🎁 New User? Get 20% off your first purchase with code NEWUSER20 Register Now →
Menu

Categories

Programming Concepts Beginner

What is Binary Search?

An efficient search algorithm that finds a target value in a sorted array by repeatedly dividing the search interval in half.

Binary search compares the target to the middle element. If smaller, search the left half; if larger, search the right half. Each step eliminates half the remaining elements, giving O(log n) time complexity — searching 1 million items takes at most 20 comparisons.

Prerequisites: the data must be sorted. Binary search is used in database index lookups, dictionary searches, and finding insertion points. Variations include lower/upper bound searches and bisection methods for continuous functions.

Related Terms

Recursion
A programming technique where a function calls itself to solve a problem by breaking it into smaller subproblems.
SOLID Principles
Five design principles for writing maintainable, flexible object-oriented code: Single Responsibility, Open-Closed, Liskov Substitution, Interface Segregation, and Dependency Inversion.
Regex (Regular Expression)
A sequence of characters that defines a search pattern, used for string matching, validation, and text manipulation.
Version Control
A system that records changes to files over time, allowing you to recall specific versions, collaborate, and track history.
Closure
A function that captures and retains access to variables from its enclosing scope, even after that scope has finished executing.
Singleton Pattern
A design pattern that restricts a class to a single instance and provides a global point of access to that instance.
 View All Programming Concepts Terms →