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.
Analysis of AlgorithmsPrinceton University
About this Course
- 5 stars73.40%
- 4 stars15.42%
- 3 stars5.31%
- 2 stars2.12%
- 1 star3.72%
TOP REVIEWS FROM ANALYSIS OF ALGORITHMS
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
I would highly recommend this course to any developer to understand algorithm analysis.
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Can I earn a certificate in this course?
More questions? Visit the Learner Help Center.