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.

Each of the algorithms discussed in this section–Linear Search, Binary Search, Bubble Sort, Selection Sort, and Insertion Sort–exhibits a O(1) (constant) space complexity for variable storage.