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.
About this Course
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
- 5 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
TOP REVIEWS FROM ANALYSIS OF ALGORITHMS
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
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.