Cody Problem 1401 asks us to sort a vector with the bubble sort algorithm and count the number of swaps needed. For example, to sort the vector [4 3 2 1] in increasing order, bubble sort requires six swaps. However, the vector can be sorted in only two swaps (4 & 1 and 3 & 2).
Write a function to determine the minimum number of swaps needed to sort a vector
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15814 Solvers
-
MATCH THE STRINGS (2 CHAR) very easy
301 Solvers
-
Calculate distance travelled when given radius and rotations
243 Solvers
-
convert matrix to single column
440 Solvers
-
546 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
