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 Solvers4
Suggested Problems
-
318 Solvers
-
448 Solvers
-
Back to basics 22 - Rotate a matrix
933 Solvers
-
Determine if input is a perfect number
259 Solvers
-
Reverse the elements of an array
1109 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
