Interactive DSA and system design

Learn complex engineering ideas by watching them move.

64stepsO(n log n)averageO(log n)space

Sorting lab

Quick Sort Partition Flow

Step 1 / 64

Comparing Pivot / Mid Swapping Sorted / Found Active Range

Animation speed

Space play / pause←→ stepR reset

Current operation

Start

Quick Sort begins with the full input array.

Try your own input

Use 3-12 positive numbers separated by commas.

Complexity notes

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

Synced code trace

function quickSort(arr, low, high) {  if (low >= high) return;  const pivot = partition(arr, low, high);  quickSort(arr, low, pivot - 1);  quickSort(arr, pivot + 1, high);}

Interactive Notes

✓ Notes are saved automatically and persist per step.