← ~/visualizations

binary-search

Sorted array being searched with binary search. Search range narrows by half each step until target found.

canvasclick to interact
t=0s

practical uses

  • 01.Teaching divide-and-conquer algorithms
  • 02.Explaining O(log n) complexity
  • 03.Visualizing search space reduction
  • 04.Demonstrating sorted array operations

technical notes

9-element sorted array. Target = 11. Mid element highlighted each step. Found state shows success.

← markov-chaindijkstra's-algorithm →