Algo Playground

Home Binary Tree AVL Tree Quick Sort Bubble Sort Merge Sort Heap Sort Selection Sort Binary Search Linear Search

Searching Studio

Binary Search

Repeatedly halve the search interval in a sorted array. Track mid pointers, range updates, and comparisons.

Inputs

Enter a sorted array (ascending) plus the target value.

Sorted numbers

Target value

The dataset will be auto-sorted for convenience before the search.

Result

Comparisons

0

Checked indices

—

Trace

Each step shows the mid index and direction of the next search.

Run the algorithm to populate steps.

Algo Playground • Experiment with multiple algorithms from the nav.