15-150: Principles of Functional Programming

Lecture 8: Sorting Trees

We implement mergesort for trees.
We show that there is considerable opportunity for parallelism compared with mergesort for lists.

Key Concepts

Sample Code

Some Notes on Sorting Trees