Binary search algorithm

Definition

The binary search algorithm is an efficient searching technique used on sorted arrays or lists. It repeatedly divides the search space in half by comparing the target value with the middle element until it finds a match or determines that the item does not exist.

Related terms

Linear Search:

A simple searching algorithm that examines every element in order until it finds the desired item.

Divide and Conquer: An algorithmic strategy where a problem is divided into smaller subproblems, solved independently, and then combined to obtain an overall solution.

Sorted Array/List: An arrangement of elements in ascending or descending order to facilitate efficient searching algorithms like binary search.