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
655 Solvers
Number of 1s in the Binary Representation of a Number
300 Solvers
255 Solvers
Are all the three given point in the same line?
157 Solvers
Set the array elements whose value is 13 to 0
683 Solvers