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

Loading...

Destrezas que aprenderás

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Revisiones

4.8 (748 calificaciones)
  • 5 stars
    647 ratings
  • 4 stars
    86 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.

Impartido por:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.