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.
Other Parameters
Loading...
Skills You'll Learn
Algorithms, Theoretical Computer Science, Mathematics, Mathematical Theory & Analysis
Reviews
4.4 (1,015 ratings)
- 5 stars62.36%
- 4 stars26.30%
- 3 stars6.69%
- 2 stars1.57%
- 1 star3.05%
FF
May 28, 2023
Analysis of algorithmsCombinatorial structuresAnalysis of combinatorial data structuresAsymptotic approximations
HA
Nov 22, 2024
It was a phenomenal Experience to be a part of this course learned a lot "THANKS TO THE CREATOR OF THIS COURSE"
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