Bubble Sort

Algorithm

Run through the entire list to sort and swap adjacent items if they are in the wrong order.
Stop when another pass through the list requires no more swaps.

Performance

Worst case: $O(n^{2})$
Best case: $O(n)$
Average case: $O(n^{2})$
Space complexity: $O(1)$