Binary search is an efficient algorithm used to find a specific value in a sorted list by repeatedly dividing the search space in half.
Related terms
Sorted List: A collection of elements arranged in ascending or descending order.
Divide and Conquer: An algorithmic technique that breaks down a problem into smaller subproblems, solves them independently, and combines their solutions to solve the original problem.