Problem 1401. Implement a bubble sort technique and output the number of swaps required
A bubble sort technique compares adjacent items and swaps them if they are in the wrong order. This is done recursively until all elements are in ascending order. Find the total number of swaps required to sort an input vector using a simple bubble sort technique. For more information see the wikipedia page: http://en.wikipedia.org/wiki/Bubble_sort
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers259
Suggested Problems
-
Basic electricity in a dry situation
548 Solvers
-
882 Solvers
-
Create an index-powered vector
666 Solvers
-
4588 Solvers
-
Find the next Fibonacci number
531 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!