Binary Search Algorithm

Definition

A binary search algorithm is an efficient searching algorithm that repeatedly divides a sorted list into halves, eliminating half of the remaining elements at each step, until it finds the target value or determines it does not exist.

Related terms

Linear Search Algorithm:

A simple searching algorithm that sequentially checks each element in a list until it finds the target value or reaches the end.

Sorted Data Set:

A collection of data arranged in ascending or descending order based on some criteria.

Divide and Conquer: An approach where problems are divided into smaller subproblems, solved independently, and then combined to obtain solutions for larger problems.