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

Loading...
Ver programa

Destrezas que aprenderás

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Revisiones

4.8 (912 calificaciones)
  • 5 stars
    791 ratings
  • 4 stars
    102 ratings
  • 3 stars
    16 ratings
  • 2 stars
    1 ratings
  • 1 star
    2 ratings
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.

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!!!

Impartido por:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explora nuestro catálogo

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