Selection Sort

1. Find the smallest value in the unsorted portion
2. Swap the value to the index after the end of the sorted portion
3. Repeat until the unsorted portion is empty

Worst case: $O(n^2)$

• Each pass of the array is $O(n)$
• Up to $n$ passes required to sort the list