⚡ AlgoZen_
// GOOD_EVENING

Hello, Hacker_

// ready_to_execute() → start your DSA journey

// SOLVED
0
// TOTAL_XP
0
// STREAK
0🔥
// START_HERE

Binary Search

Efficiently find an element in a sorted array by repeatedly halving the search space. Each comparison eliminates half the remaining candidates.

BeginnerO(log n)+100_XP
EXECUTE →
// LEARNING_PATH
VIEW_ALL →