Turning Learners Into Developers
Codekilla
CODEKILLA
back to course
Lesson 27 / 14918%
Arrays9/11

Searching in Arrays — Binary Search

O(log n) divide-and-conquer on a sorted array.

// binary search · SORTED array · halve the search space · O(log n)target = 2124791217212530Click a step to watch the search window shrink by half each pass.
Visual explanation diagram · click steps to walk through it

This lesson is Pro only.

Unlock every premium lesson and module — Pro from ₹299 / month (or ₹999 / year, saves ~₹2,589).

Sign in to unlock
// feedback.matters()
Did this lesson help you?