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

Loading...
Ver programa

Destrezas que aprenderás

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Revisiones

4.8 (949 calificaciones)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

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.

Impartido por:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explora nuestro catálogo

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