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 (992 ratings)
  • 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.

Taught By

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explore our Catalog

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