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 Solvers276
Suggested Problems
-
Given two arrays, find the maximum overlap
1453 Solvers
-
Back to basics 6 - Column Vector
1052 Solvers
-
Back to basics 21 - Matrix replicating
1486 Solvers
-
Sum of odd numbers in a matrix
559 Solvers
-
Number of Even Elements in Fibonacci Sequence
1261 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!