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

Loading...
Visualiser le programme de cours

Compétences que vous apprendrez

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Avis

4.8 (847 notes)
  • 5 stars
    730 ratings
  • 4 stars
    99 ratings
  • 3 stars
    15 ratings
  • 2 stars
    1 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!!!

SK

Oct 16, 2017

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

Enseigné par

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.