The Ackermann Function [Advanced - Optional]

Loading...
Просмотреть программу курса

Получаемые навыки

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Рецензии

4.8 (оценок: 1,036)
  • 5 stars
    87.06%
  • 4 stars
    11%
  • 3 stars
    1.64%
  • 2 stars
    0.09%
  • 1 star
    0.19%
SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

Преподаватели

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.