THINK++ — Engineering Visualized

📖 LESSON

Binary Search Basics

Binary Search is a highly efficient algorithm for finding an item from a sorted list of items. It works by repeatedly halving the search interval.

O(log N)

Binary search can find an element among 1 million items in just 20 steps.

Simulation Lab v2.0

Graph Engine Ready

Timeline

1/7

Edit Mode

Speed1000ms

Double-Click to Spawn

Drag Panels to Organize

💡 The 'mid' Overflow Bug

Never use `(low + high) / 2` because it can overflow if `low + high` exceeds the maximum integer value. Always use `low + (high - low) / 2`.

Loading Lab...