Insertion sort on [22 10 15 3 8 2]
  insert 10 at index 0: [10 22 15 3 8 2]
  insert 15 at index 1: [10 15 22 3 8 2]
  insert 3 at index 0: [3 10 15 22 8 2]
  insert 8 at index 1: [3 8 10 15 22 2]
  insert 2 at index 0: [2 3 8 10 15 22]
  result [2 3 8 10 15 22], comparisons = 15, shifts = 13
Already sorted input
  result [2 3 8 10 15 22], comparisons = 5, shifts = 0
Reversed input
  result [2 3 8 10 15 22], comparisons = 15, shifts = 15
