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 also started our discussion of sorting. We reviewed the pre-defined order datatype and analyzed the work of insertion sort.

Some Notes on Asymptotic Analysis

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