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

Loading...
查看授課大綱

您將學習的技能

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

審閱

4.8(988 個評分)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
AB

Apr 23, 2020

Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!

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.

教學方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。