Ordinary Generating Functions

Loading...
Princeton University
4.8 (52 ratings) | 22K Students Enrolled
View Syllabus

Reviews

4.8 (52 ratings)
  • 5 stars
    45 ratings
  • 4 stars
    3 ratings
  • 3 stars
    3 ratings
  • 1 star
    1 ratings
AK

Apr 29, 2018

This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems

HL

Mar 10, 2018

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

From the lesson
Generating Functions
Since the 17th century, scientists have been using generating functions to solve recurrences, so we continue with an overview of generating functions, emphasizing their utility in solving problems like counting the number of binary trees with N nodes.

Taught By

  • Robert Sedgewick

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.