Asymptotic notations, omega, theta, recurrences, substitution, master method.
Algorithms, computational complexity, asymptotic notations, pseudocode, greedy algorithms, easy vs. hard problems.
Introduction to Big-O notation and code analysis.
Recurrence, generating functions, inclusion-exclusion principle, divide-and-conquer, application to algorithm design.
Notations for this analysis
Screencast Suthers 12 min
The omega and theta notations
Screencast Suthers 17 min
The little guys, properties, and use in equations
Screencast Suthers 16 min
Common functions and useful identities
Screencast Suthers 9 min
Asymptotic notation, standard notation, and common functions.
Textbook 22 pages
Introduction to asymptotic analysis
Notes
Asymptotic notation, recurrences, substitution, master method (start at 16 min)
Screencast Demaine 71 min
