Selection sort is an algorithm that selects the smallest(or minimum) element from an unsorted list in each iteration and move that element at the beginning of the unsorted list.
| Best | Average | Worst | Space (Memory) | Stable | Advantage |
|---|---|---|---|---|---|
| O(n2) | O(n2) | O(n2) | O(1) | Yes | Works well with small list |