Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]

Loading...
查看授課大綱

您將學習的技能

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

審閱

4.8(777 個評分)
  • 5 stars
    674 ratings
  • 4 stars
    88 ratings
  • 3 stars
    13 ratings
  • 1 star
    2 ratings
JP

Oct 20, 2018

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

JF

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

教學方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我們的目錄

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