AlgoThrive
← All sorting algorithms

Insertion Sort

DefaultComparingSwappingPivotSorted
Main Array Workflow
8
3
11
6
1
9
4
7

pseudocode

for i from 1 to n-1
  key = a[i]
  j = i - 1
  while j >= 0 and a[j] > key
    a[j+1] = a[j]; j = j - 1
  a[j+1] = key

Frame 1 / 51

Start

unsorted array

4

3–16 integers between 1 and 20.