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.

The fully functional program in Listing 4 doesn’t implement a Java 8 version of the Bubble Sort algorithm like I said it would: instead, it relies on whatever algorithm is used by the sorted() ...