Insertion sort is a sorting algorithm that will sort an array of numbers.
Input five numbers ranging from 1 to 100 in random order:
Right off the bat [0] is considered fully sorted.