The simplest sort, although inefficient. Below is a demonstration of

bubble sort and insertion sort.

The bubble sort just consists of 2 for loops and std::swap.

The insertion sort uses 2 loops as well but not as much swap

as bubble sort.

Any questions ?