Quicksort is another recursive sorting algorithm that works by dividing lists in half. Whereas mergeSort divided lists in half and then sorted each sublist, QuickSort will roughly sort the entire list, and then split the list in half. The order of these two sorts falls into the category O(N * log N), which was introduced in Lesson AB25, Order of Algorithms. When the lists become large, either of these sorts will do an excellent job.

The key topics for this lesson are:

1. QuickSort
2. Order of QuickSort