Solving Recurrences

video-placeholder
Loading...
Ver programa

Reseñas

4.5 (184 calificaciones)

  • 5 stars
    73,91 %
  • 4 stars
    14,67 %
  • 3 stars
    5,43 %
  • 2 stars
    2,17 %
  • 1 star
    3,80 %

AK

28 de abr. de 2018

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

AV

24 de ago. de 2020

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

De la lección

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.

Impartido por:

  • Placeholder

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.