Binary Search Visualizer
Slow Fast
⚠️ AUTO-SORTED
System Ready
Analysis
Worst Case: O(log n)
Steps: 0
100% Active
Execution
while (low <= high) {
mid = Math.floor((low + high) / 2);
if (arr[mid] === target) return mid;
else if (arr[mid] < target) low = mid + 1;
else high = mid - 1;
}
Event Log