12
15
14
5
9
16
7
8
4
10
4
10
3
1
16
15
# Steps: 0
SortVis
Insertion Sort, O(n²)
Insertion sort is an adaptive algorithm that works with two sublists. The lower sublist is always sorted; the algorithm then inserts elements from the upper sublist where they fit in the lower sublist.