Binary Search Visualizer

Setup Array

Search Controls

Array Visualization

Algorithm Steps

How to Use

Setup: Enter sorted numbers separated by commas or click "Random Sorted" to generate an array
Search: Enter a number to search for and click "Start Search"
Step Through: Click "Next Step" to see each step of the algorithm execution
Run Through: Click "Run Through" to automatically execute all steps in sequence
Observe: Watch the array elements change colors and algorithm steps highlight on the right
Reset: Click "Reset" to start over with a new search

Colors: Blue = Begin, Purple = End, Orange = Mid, Green = Found, Red = Excluded

Binary Search Concept

Binary Search is an efficient searching algorithm that works on sorted arrays by repeatedly dividing the search interval in half.

How it works:

Start with entire sorted array
Find middle element and compare with target
If target equals middle, found the element
If target is smaller, search left half
If target is larger, search right half
Repeat until found or search space is empty

Time Complexity: O(log n) - much faster than linear search

Use Cases

Dictionary/Phonebook Lookup: Finding words in a sorted dictionary or names in a phonebook efficiently
Database Queries: Searching indexed database records for fast data retrieval in millions of rows
Library Book System: Finding books by ISBN or catalog number in a sorted library database
Binary Search Trees: Foundation for BST operations to find, insert, and delete elements quickly
Version Number Search: Finding specific software versions in a sorted list of releases
Timestamp Search: Locating specific events or log entries in a sorted time-series dataset
Coordinate Search: Finding positions in sorted geographic coordinates or measurements
Performance-Critical Systems: Real-time systems requiring predictable O(log n) search performance

Real-World Example

Scenario: A large online bookstore maintains a sorted database of 1 million books by ISBN. When a customer searches for a specific ISBN, binary search quickly locates the book without checking every entry.

Input: Sorted list of 1,000,000 ISBNs, target ISBN to find
Process: Compare target with middle ISBN, eliminate half of search space each iteration, repeat log(1,000,000) ≈ 20 times
Output: Book record found in ~20 comparisons (vs 500,000 with linear search)

Binary search is ideal for large sorted datasets because it dramatically reduces search time from linear O(n) to logarithmic O(log n). For a million records, it requires only ~20 comparisons instead of ~500,000. The algorithm's efficiency becomes critical when serving thousands of concurrent users in e-commerce or database systems. The key requirement is that data must be sorted—a one-time cost that pays dividends for repeated searches.

Benefits: Exponential speedup, scales to massive datasets, predictable performance, minimal memory overhead, foundation for advanced data structures