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
-
Find the peak 3n+1 sequence value
2313 Solvers
-
Project Euler: Problem 7, Nth prime
1382 Solvers
-
664 Solvers
-
Generate N equally spaced intervals between -L and L
841 Solvers
-
667 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!