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

Loading...
View Syllabus

Skills You'll Learn

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Reviews

4.8 (829 ratings)
  • 5 stars
    715 ratings
  • 4 stars
    97 ratings
  • 3 stars
    15 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!!!

SK

Oct 16, 2017

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

Taught By

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explore our Catalog

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