How Insertion Sort Works
- Waiting
- Being compared
- Just moved
- In final position
1/95
Insertion sort, 12 values in random order.
Settings
More options
Starting order
Two to 48 numbers, used in the order you type them.
Insertion Sort
- 1
for i in 1..n-1: - 2
key = a[i] - 3
j = i - 1 - 4
while j >= 0 and a[j] > key: - 5
a[j+1] = a[j] - 6
j -= 1 - 7
a[j+1] = key
How the Seven Compare
| Algorithm | Best | Average | Worst | Extra memory | Stable |
|---|---|---|---|---|---|
| Bubble | O(n) | O(n²) | O(n²) | O(1) | Yes |
| Insertion | O(n) | O(n²) | O(n²) | O(1) | Yes |
| Selection | O(n²) | O(n²) | O(n²) | O(1) | No |
| Shell | O(n log n) | O(n√n) | O(n²) | O(1) | No |
| Merge | O(n log n) | O(n log n) | O(n log n) | O(n) | Yes |
| Quick | O(n log n) | O(n log n) | O(n²) | O(log n) | No |
| Heap | O(n log n) | O(n log n) | O(n log n) | O(1) | No |
Scroll the table sideways for the rest of the columns.
Stable means equal values keep their original order.