Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. 

The time complexity of insertion sort is O(n^2)

Note:  Insertion Sort is much less efficient on large lists than more advanced algorithms such as Quick Sort, Heap Sort, or Merge Sort.