Insertion Sort and Nearly Sorted Data Explorer

Insertion sort builds a sorted prefix by shifting larger prefix values to make room for each next value. Experiment with a small example and see each step update.