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 video starts by describing two common sorting algorithms; “ bubble sort ” and “ insertion sort.” In the former, a sorting algorithm repeatedly steps through a list that needs to be ...