Insertion Sort

1. He would get an initial card.
2. He would get a second card and shuffle so he has them in order.
3. Then goes inserting it to the left until it reaches the slot where there is no card with less value.
4. Repeats the same algorithm with the next cards.

• Worst case scenario Θ($$n^2$$)