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).

Given a list of data points, sort those data points into ascending / descending order by some quantity. Suppose we want to rearrange a sequence to put elements into ascending order …

Chapter 7: Quicksort Quicksort is a divide-and-conquer sorting algorithm in which division is dynamically carried out (as opposed to static di.

ð Bubble sort was originally written to “bubble up” the highest element in the list. From an efficiency point of view it makes no difference whether the high element is bubbled or the low …

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

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