The Knapsack Problem

Loading...
查看授课大纲

您将学习的技能

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

审阅

4.8(773 个评分)
  • 5 stars
    671 ratings
  • 4 stars
    87 ratings
  • 3 stars
    13 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!!!

JF

Jan 14, 2018

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

从本节课中
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

教学方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。