Correctness Proof I

Loading...
查看授课大纲

您将学习的技能

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

审阅

4.8(1,020 个评分)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

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.

从本节课中
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

教学方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我们的目录

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