README.md

Insertion Sort

Algorithm

insertionSort(array, n):
    for i = 2 -> n:
        key = array[i]
        j = i - 1
        while j > 0 and array[j] > key:
            array[j+1] = array[j]
            j = j - 1
        array[j+1] = key

Complexity

• Time:
  • Worst Case:
  • Average Case:
  • Best Case:
• Space:
  • Worst Case: