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.
- 5 stars73.60%
- 4 stars14.72%
- 3 stars5.07%
- 2 stars2.03%
- 1 star4.56%
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
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.