Sorting Given a sorted array, we can leverage binary search to make an efficient set data structure.

When implementing the sorting algorithm on linked lists, it is strongly recommended to implement helper functions for the divide/join components of the algorithm.

Stable sort A sorting algorithm is stable if any equal items remain in the same relative order before and after the sort Why do we care?

Two slightly better O(n2) algorithms are Selection Sort and Insertion Sort.

1 Sorting Algorithms sort according to some ordering. These could be integers or real numbers we want to sort numerically, words we want to sort alphabetically, or diamonds we wan

In the previous course you should have seen at least one sorting algorithm. We will quickly review three most popular quadratic sorts, and then move on to more efficient sort techniques.

In the best case, the bubble sort algorithm needs just the first pass to find that the array is already sorted—no next pass is needed. Since the number of comparisons is n - 1 in the first pass, the …