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 …

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

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.

Sorting is so common, that we often start caring about constant factors.

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.

Sort an array, A, of items (numbers, strings, etc.). Why sort it? To use in binary search. To compute rankings, statistics (min/max, top-10, top-100, median). .... Pros/cons, behavior . …