How Selection Sort Works
- Waiting
- Being compared
- Just moved
- In final position
1/97
Selection sort, 12 values in random order.
Settings
More options
Starting order
Two to 48 numbers, used in the order you type them.
Selection Sort
- 1
for i in 0..n-2: - 2
min = i - 3
for j in i+1..n-1: - 4
if a[j] < a[min]: - 5
min = j - 6
swap(i, min) - 7
// a[i] is now final
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.