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.
BGFs and Distributions
Loading...
Skills You'll Learn
Algorithms, Advanced Mathematics, Theoretical Computer Science, Probability, Mathematical Theory & Analysis, Mathematical Modeling, Data Structures, Combinatorics
Reviews
4.4 (1,024 ratings)
- 5 stars62.30%
- 4 stars26.26%
- 3 stars6.73%
- 2 stars1.66%
- 1 star3.02%
RM
May 2, 2025
Course was very good. But after completing the course successfully, I have not received the certificate till now.
FF
May 28, 2023
Analysis of algorithmsCombinatorial structuresAnalysis of combinatorial data structuresAsymptotic approximations
From the lesson
Permutations
The study of sorting algorithms is the study of properties of permutations. We introduce analytic-combinatoric approaches to studying permutations in the context of this relationship.
Taught By
Robert Sedgewick
William O. Baker *39 Professor in Computer Science, Emeritus