Binary Search Simulation
Status Log
Welcome! Enter a number and click 'Search' to begin.
Controls
Infographics
Midpoint Calculation
mid = floor((low + high) / 2)
Time Complexity
O(log n)
Extremely efficient. The search time grows very slowly as the array size increases.