Insertion Sort
- Insertion Sort is a sorting algorithm that places unsorted elements in their place each iteration.
- Insertion sort is similar to how people sort cards.
- This sort is performed by starting with the first element and sorting down all the way to the last element.
