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

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 to sort according to …

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

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

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

Replace downward pairwise swaps, with binary search in A[0 : i]. Called Binary Insertion Sort. Key Property: Sort is done recursively. See Figure 4: The leaves correspond to matrices of size 1 …

Your Turn! Try running this sort, as well as in debug mode. It prints a lot, but you can sort of see the two steps— splitting and merging—occurring, just by the width of the left and right arrays …