Robert Sedgewick
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. It does not offer a certificate upon completion. Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
Instructor Details
Courses : 4
Specification: Analysis of Algorithms
|
7 reviews for Analysis of Algorithms
Add a review
| Provider | |
|---|---|
| Duration | 22 hours |
| Year | 2018 |
| Level | Expert |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Hafidz J L –
This is great course if you already done some algorithms courses and want to go deeper.
Konstantin –
I didn’t like this course at all. Cover less material, but explain it better. Most of the students drop out after week 3.
Andriy K –
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Ivan F –
This course offers an extensive coverage of mathematical material like tools and techniques, putting special emphasis on simple principles and never losing its focus on the general perspective of the topic. Developing insight on analytic functions together with combinatorics and the practical applications of theory into code gives a significant advantage over using naive approaches. A special appreciation to Prof. Sedgewick’s endless efforts for disseminating mathematical knowledge among programmers, over this platform and even outside! Thank you very much.
HelloIsJeffrey –
This course is very helpfull!
Zhenwei L –
Some of the problems are very interesting and I’m quite impressed by the symbolic method. Howerver, part of the contents are too “detailed” which is dull in my opinion.
Madhav N W –
Excellent course, great exercise in combinatorics.