Selection Sort

·Easy·Sorting

Find minimum each pass · place at sorted boundary

Practice mode

Try your own input

Change the array and replay the algorithm from step one.

Step

Current step

Selection Sort: find the minimum in the unsorted portion and place it at the sorted boundary.

Array workspace

Selection Sort

Step 1 / 26init

100%

[0]

[1]

[2]

[3]

[4]

step 1 / 26

Space play← → stepHome reset

TimeO(n²)·SpaceO(1)

Selection Sort

1function selectionSort(arr) {//i: —minIdx: —
2  for (let i = 0; i < arr.length; i++) {
3    let minIdx = i;
4    for (let j = i + 1; j < arr.length; j++) {
5      if (arr[j] < arr[minIdx]) {
6        minIdx = j;
7      }
8    }
9    if (minIdx !== i) {
10      [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
11    }
12  }
13  return arr;
14}

i—

minIdx—

Command Palette

Selection Sort

Selection Sort