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
Find the longest sequence of 1's in a binary sequence.
2254 Solvers
Omit columns averages from a matrix
469 Solvers
2014 Solvers
Find nearest prime number less than input number
142 Solvers
Replace multiples of 5 with NaN
270 Solvers