Binary Search
Efficiently finds target element in a sorted list by repeatedly halving the search interval.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def binary_search(arr, target):
low = 0
high = len(arr) - 1
while low <= high:
mid = (low + high) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
low = mid + 1
else:
high = mid - 1
return -1Embed this visualization
Drop a live, looping Binary Search canvas into a blog post or course page.
<iframe src="/embed/binary-search" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of Binary Search?
Binary Search runs in O(log n) time and O(1) auxiliary space.
Is the Binary Search visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask Binary Search in interviews?
Binary Search shows up in interviews at Google, Amazon, Apple, Meta.
How does the 3D visualization of Binary Search work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.