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

Loading...

Получаемые навыки

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Рецензии

4.8 (оценок: 741)
  • 5 stars
    641 ratings
  • 4 stars
    85 ratings
  • 3 stars
    13 ratings
  • 1 star
    2 ratings

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

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

Преподаватели

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.