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 Algorithms
Princeton University
via Coursera
Instructor(s)
Robert Sedgewick
Princeton University
via Coursera
Free (audit)
English
Approx. 21 hours to complete
Self paced
Advanced Level
Subtitles: Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish