AlgoThrive
← All sorting algorithms

Selection Sort

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

pseudocode

for i from 0 to n-1
  min = i
  for j from i+1 to n-1
    if a[j] < a[min] then min = j
  swap a[i], a[min]

Frame 1 / 49

Start

unsorted array

4

3–16 integers between 1 and 20.