Now, if this list is sorted again by tutorial group number, a stable sort algorithm would ensure that all students in the same tutorial groups still appear in alphabetical order of their names

Exercise. Show that for n = 5, it is possible to sort using 7 comparisons (tricky).

Selection sort, however, is always O(n2) because you always have to search the remainder of the list to guarantee that you’re finding the minimum at each step.

/* Sorts by selecting smallest element in unsorted portion of array and exchanging it with element at the beginning of the unsorted list.

Def. AA sorting algorithm is in-place if it uses ≤ c log N extra memory. Ex. Insertion sort, selection sort, shellsort.

If we sort a LinkedList, this implementation dumps the specified list into an array, sorts the array, and iterates over the list resetting each element from the corresponding position in the array.

Quick Sort name implies, it is quick, and it is the generally preferred for sorting.