Analysis of Algorithms
About this 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.
83/100
CourseAsk score
- What the provider tells you
- 32/45
- Who stands behind it
- 35/35
- How complete the listing is
- 16/20
Scores how much the provider publishes and who stands behind it — not how well it is taught.
What you'll learn
- understand generating functions and their applications
- apply real asymptotic analysis techniques
- develop skills in analyzing combinatorial structures
Price shown by Coursera — confirm on their site.
Enroll on CourseraYou'll be redirected to Coursera to complete enrollment.
- Listed & compared by CourseAsk
- English · 0
Udemy
Coursera
Compared on these lists
Where this course ranks against the alternatives.