Ordinary Generating Functions

video-placeholder
Loading...
강의 계획표 보기

검토

4.5개(151개 평가)

  • 5 stars
    76.15%
  • 4 stars
    11.25%
  • 3 stars
    5.96%
  • 2 stars
    2.64%
  • 1 star
    3.97%

AV

2020년 8월 24일

I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.

ON

2020년 4월 7일

Wonderful insights about the study of the algorithm's complexity and combinatoric logic.

수업에서

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.

강사:

  • Placeholder

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.