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.
Offered By
Analysis of Algorithms
Princeton UniversityAbout this Course
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessCould your company benefit from training employees on in-demand skills?
Try Coursera for BusinessOffered by
Syllabus - What you will learn from this course
Analysis of Algorithms
Recurrences
Generating Functions
Asymptotics
Reviews
- 5 stars72.86%
- 4 stars15.07%
- 3 stars5.52%
- 2 stars2.01%
- 1 star4.52%
TOP REVIEWS FROM ANALYSIS OF ALGORITHMS
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
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.