Insertion Sort Algorithm based on Chapter 2 from Introduction to Algorithms

Insertion Sort is an efficient algorithm for sorting small number of
elements. It works by taking a key element (A[j]) and comparing it to
the rest of the list (A[1..j - 1]), inserting the key in the appropriate
location.