Algorithms and Data Structures (INF1)
Lecture 11
Main topic: Sorting.
Lecture Plan
- quiz no. 2
- merge sort
- quick sort
- radix sort
- lower bound for sorting
- comparison of sorting algorithms
Reading
-
Sections 9.3 - 9.6, 11.1
of Algorithms and Data Structures: Design, Correctness and Analysis
by Jeffrey H. Kingston.
- Section 8.1 (Lower bounds for sorting) from Introduction to Algorithms
by Thomas H. Cormen (available in the course folder).