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
-
Determine whether a vector is monotonically increasing
22857 Solvers
-
7467 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
679 Solvers
-
Find nearest prime number less than input number
1016 Solvers
-
194 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!
