Counting with Generating Functions

Loading...
普林斯顿大学
4.7(50 个评分) | 21K 名学生已注册
查看授课大纲

审阅

4.7(50 个评分)
  • 5 stars
    43 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.

从本节课中
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.

教学方

  • Robert Sedgewick

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。