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

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

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 …

! ” # $ % & ' () * + , - ./ 0 1 2 3 4 5 6 7 8 9 :;< = >?

In this lecture we consider two related algorithms for sorting that achieve a much better running time than the selection sort from an earlier lecture: mergesort and quicksort. We develop …

Sorting Linked Lists We defined the sorting problem as over an array, but sometimes you want to sort linked lists One approach: Convert to array: O(n) Sort: O(n log n) Convert back to list: O(n)