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
nice!
984 Solvers
Increment a number, given its digits
505 Solvers
152 Solvers
Switch matrix to a column vector
189 Solvers
424 Solvers