Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. Insertion sort is a comparison sort, i.e. it sorts only by comparing and swapping list elements. https://en.wikipedia.org/wiki/Insertion_sort
Part of my series of sorting algorithms: https://scratch.mit.edu/studios/14132246/
