15-150: Principles of Functional Programming

Lecture 7: Asymptotic Analysis

We analyzed the Work associated with several of our recently implemented functions.

We analyzed the Span of one tree function, noting that parallelism could speed up evaluation of that function for balanced trees.

We also started our discussion of sorting, by implementing and analyzing insertion sort.

(NOTE: Page 7 contains a table of recurrences and their associated big-O solutions.)

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