Path Compression: Tarjan's Analysis I [Advanced - Optional]

Loading...
查看授课大纲

您将学习的技能

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

审阅

4.8(1,056 个评分)
  • 5 stars
    87.12%
  • 4 stars
    10.98%
  • 3 stars
    1.60%
  • 2 stars
    0.09%
  • 1 star
    0.18%
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.

教学方

  • Placeholder

    Tim Roughgarden

    Professor

探索我们的目录

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