Bubble sort

Bubble sort is the simplest exchange sorting algorithm.

Each element of the array is compared (and swapped if bigger) with every other element of the array.

The worst-case and average complexity is O(n²).

This algorithm should only be used on almost sorted array (that implies few permutations).

Resources

https://en.wikipedia.org/wiki/Bubble_sort