Analysis of Algorithms

Analysis of Algorithms is Robert Sedgewick's Princeton course on the mathematics used to make precise quantitative predictions about large combinatorial structures. It covers recurrences, generating functions and real asymptotics, then introduces the symbolic method of analytic combinatorics and applies it to the analysis of algorithms and to basic structures such as permutations, trees, strings, words and mappings. Its nine modules follow that order: analysis of algorithms, recurrences, generating functions, asymptotics, analytic combinatorics, trees, permutations, strings and tries, and words and mappings.

Coursera labels the course advanced level with a flexible schedule and estimates two weeks at ten hours a week. The page states that all the features of the course are available for free and that, as per Princeton University policy, no certificates, credentials or reports are awarded. The textbook Analysis of Algorithms, Second Edition is optional, and a companion course on analytic combinatorics goes further into the method.