> [!tldr] For ordered things. Look at the middle one? That is? To the left or right? Repeat. A [[Binary]] search is the repeated process of looking for a particular thing inside an **ordered sequence** of things by repeatedly looking at the middle thing in the group, then deciding if the thing you're looking for is to the left or right of the middle thing, removing whichever half does *not* contain the thing you're looking for, then repeating the process until the middle thing *is* the thing you're looking for. ![[Binary Search 2026-01-26 10.27.54.excalidraw.svg]] %%[[Binary Search 2026-01-26 10.27.54.excalidraw.md|🖋 Edit in Excalidraw]]%% Indexes make this search more [[Efficiency|efficient]], especially over large data. **** # More ## Source - self