Interactive DSA and system design

Learn complex engineering ideas by watching them move.

72stepsO(n²)averageO(1)space

Sorting lab

Insertion Sort Shift and Place Flow

Step 1 / 72

Comparing Pivot / Mid Swapping Sorted / Found Active Range

Animation speed

Space play / pause←→ stepR reset

Current operation

Start

Insertion Sort begins. The first element is considered sorted. Each remaining element is inserted into its correct position.

Try your own input

Use 3-12 positive numbers separated by commas.

Complexity notes

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

Synced code trace

function insertionSort(arr) {  for (let i = 1; i < n; i++) {    const key = arr[i];    let j = i - 1;    while (j >= 0 && arr[j] > key)      arr[j + 1] = arr[j--];    arr[j + 1] = key;  }}

Interactive Notes

✓ Notes are saved automatically and persist per step.