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 Solvers268
Suggested Problems
-
How to find the position of an element in a vector without using the find function
2694 Solvers
-
Numbers spiral diagonals (Part 1)
188 Solvers
-
Find out sum and carry of Binary adder
1347 Solvers
-
391 Solvers
-
Spot the First Occurrence of 5
415 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!