Interactive DSA and system design

Learn complex engineering ideas by watching them move.

87stepsO(n²)averageO(1)space

Sorting lab

Selection Sort Find-Min and Swap Flow

Step 1 / 87

Comparing Pivot / Mid Swapping Sorted / Found Active Range

Animation speed

Space play / pause←→ stepR reset

Current operation

Start

Selection Sort begins. It repeatedly finds the minimum element from the unsorted portion and places it at the front.

Try your own input

Use 3-12 positive numbers separated by commas.

Complexity notes

O(n²)averageO(n²)worstO(1)spaceNostable

Synced code trace

function selectionSort(arr) {  for (let i = 0; i < n - 1; i++) {    let min = i;    for (let j = i + 1; j < n; j++)      if (arr[j] < arr[min]) min = j;    swap(arr, i, min);  }}

Interactive Notes

✓ Notes are saved automatically and persist per step.