Back to Analysis of Algorithms
Learner Reviews & Feedback for Analysis of Algorithms by Princeton University
1,033 ratings
About the Course
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.
All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Analysis of Algorithms, Second Edition (upon which the course is based) or to visit the website aofa.cs.princeton.edu for a wealth of additional material.
This course does not offer a certificate upon completion.
Top reviews
AK
Jun 2, 2024
course is good but it is little bit boring and lengthy.
NP
Aug 13, 2022
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
Filter by: