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

Loading...
View Syllabus

Skills You'll Learn

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Reviews

4.8 (953 ratings)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
JE

Dec 28, 2019

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

NS

Mar 15, 2020

Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.

Taught By

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.