There are many sorting algorithms.
This chapter looks at another frequently used simple sort, **insertion sort.**
As with all simple sorts,
its running time is proportional to the square of the number of elements, so
use it only with small arrays.

- Insertion Sort
- Swap
- Running Time of Insertion Sort
- Best Case Running Time
- Average Case Running Time
- Arrays Class

Is this list of one integer in order?

26