Interactive DSA and system design

Learn complex engineering ideas by watching them move.

10stepsO(log n)averageO(1)space

Searching lab

Binary Search Divide and Conquer

Step 1 / 10

low

high

Comparing Pivot / Mid Swapping Sorted / Found Active Range

Animation speed

Space play / pause←→ stepR reset

Current operation

Start

Search for target 36 in the sorted array. Each step halves the search range.

Algorithm state

36Target0Low9High10Range Size

Try your own input

Use 3-12 positive numbers separated by commas.

Complexity notes

O(log n)averageO(log n)worstO(1)spaceN/Astable

Synced code trace

function binarySearch(arr, target) {  let low = 0, high = arr.length - 1;  while (low <= high) {    const mid = Math.floor((low + high) / 2);    if (arr[mid] === target) return mid;    else if (arr[mid] < target) low = mid + 1;    else high = mid - 1;  }  return -1;}

Interactive Notes

✓ Notes are saved automatically and persist per step.