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.

For example, the Binary Search algorithm is almost always more efficient than the Linear Search algorithm–something you’ll see for yourself in Part 2.