The algorithm functions as follows: It compares the target value with the middle element of the dataset. If the target matches the middle element, the search is declared successful.

In software I’m finding a lot of algorithms that have unfortunate O(n**2) time complexity but can be reduced to O(n*log(n)) with the use of binary search or something equivalent on the inner loop.