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 stars72.77%
- 4 stars15.18%
- 3 stars5.23%
- 2 stars2.09%
- 1 star4.71%
ANALYSIS OF ALGORITHMS의 최상위 리뷰
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
I would highly recommend this course to any developer to understand algorithm analysis.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
Can I earn a certificate in this course?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.