“We had to control how big a number shows up as we do this guessing and coordination,” said Peng. Peng and Vempala prove that their algorithm can solve any sparse linear system in n 2.332 steps. This ...

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.