An insertion sort is an efficient algorithm for sorting a small number of elements. Insertion sort works the same way as sorting a hand of playing cards, i.e. starting with an empty left hand and ...