The Knapsack Problem

Loading...
Просмотреть программу курса

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

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Рецензии

4.8 (оценок: 926)
  • 5 stars
    803 ratings
  • 4 stars
    104 ratings
  • 3 stars
    16 ratings
  • 2 stars
    1 ratings
  • 1 star
    2 ratings
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.

Из урока
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

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

  • Tim Roughgarden

    Tim Roughgarden

    Professor

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

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