15-150: Principles of Functional Programming

Lecture 6: Asymptotic Analysis

We discussed Big-O notation and 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.

Some Notes on Asymptotic Analysis

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

Sample Code

Slides from Lecture