Module: Growth of functions

Asymptotic notations, omega, theta, recurrences, substitution, master method.

Prerequisite Modules

Learning Outcomes

Characterize algorithms with respect to asymptotic growth, including:

Readings