juniorSearching
What is Binary Search?
Updated Apr 28, 2026
Short answer
An efficient search algorithm for sorted lists that repeatedly divides the search interval in half.
Deep explanation
Searching is a fundamental operation in computer science. An efficient search algorithm for sorted lists that repeatedly divides the search interval in half. Linear search is reliable for small or unsorted datasets, while Binary search scales much better for large, ordered data.
Real-world example
Looking for a specific name in a randomly ordered list of names.
Common mistakes
- Trying to use Binary Search on an unsorted array.
Follow-up questions
- What is the worst-case time complexity of Binary Search?