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 comments
Loading...
Problem Recent Solvers404
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53966 Solvers
-
14067 Solvers
-
589 Solvers
-
Circular Primes (based on Project Euler, problem 35)
662 Solvers
-
Rounding off numbers to n decimals
5845 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!