#searching

Binary Search: Halving the Haystack

Search a sorted array in O(log n) by halving it every step. Watch lo, mid, and hi close in on the target with an interactive visualizer and runnable Python.