Analysis of Algorithms

Instructor

Robert Sedgewick

  • William O. Baker Professor of Computer Science

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.


Course Status

In Session 

What Learners Say

"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."

"This is great course if you already done some algorithms courses and want to go deeper."