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

From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
741 ratings
Stanford University
741 ratings
Course 3 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Computer Science

Explore our Catalog

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