15-150: Principles of Functional Programming

Lecture 8: Sorting Lists

We started off with implementing and analyzing insertion sort.
Then, we implemented mergesort and analyzed its work and span.
We saw that mergesort offers a nice opportunity for parallel speedup.

Key Concepts

Sample Code

Some Notes on Integer Sorting using Lists

Some Notes on Integer Sorting using Trees

Lecture Slides

Lecture Slides with every build, use "slideshow" option in your pdf viewer. Lecture Slides compact.