Search AlgorithmsBeginner

Binary Search

Highly efficient search method that compares the target with the middle element and repeatedly halves the search space. With O(log n) time, it can find an item in 1 million elements in just 20 comparisons. Works like looking up words in a dictionary.

#searching#divide-and-conquer#efficient

Complexity Analysis

Time (Average)

O(log n)

Expected case performance

Space

O(1)

Memory requirements

Time (Best)

O(1)

Best case performance

Time (Worst)

O(log n)

Worst case performance

📚 CLRS Reference

Introduction to Algorithms•Chapter 2•Section 2.3-5

Quick Presets

Sorted Array (comma-separated numbers, 1-100, max 20 elements)

Target Value (number to search for)

Step: 1 / 0

Animation Speed500ms

SlowFast

Keyboard Shortcuts

Space Play/Pause← → StepR Reset1-4 Speed

Real-time Statistics

Algorithm Performance Metrics

Progress0%

Comparisons

Swaps

Array Accesses

Steps

1/ 0

Algorithm Visualization

Step 1 of 0

Initialize array to begin

Default

Comparing

Swapped

Sorted

Code Execution

Currently executing

Previously executed

Implementation

Related Algorithms

View all in Search Algorithms

Linear Search

Beginner

The most basic search method that checks each element sequentially from start to end. Used for unsorted data or small arrays where simplicity matters. Implementation is straightforward, but becomes slow with large datasets requiring O(n) time.

Back to Search Algorithms