Binary Search Method

Definition

A binary search method is a searching algorithm that divides a sorted list into two halves and repeatedly compares the middle element of each half to the target value, eliminating half of the remaining elements with each comparison until the target value is found or determined to be not in the list.

Related terms

Sorted List: A sorted list is an ordered collection of elements where each element is arranged in ascending or descending order.

Searching Algorithm: A searching algorithm is a step-by-step procedure used to locate specific data within a given set of data.

Target Value: The target value refers to the value being searched for within a dataset.