Chevron Left
返回到 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

学生对 斯坦福大学 提供的 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的评价和反馈

4.8
1,209 个评分

课程概述

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees)....

热门审阅

FC

Jun 29, 2018

Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!

RG

Apr 26, 2020

I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.

筛选依据:

1 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的 25 个评论(共 141 个)

创建者 Sachin W

Feb 25, 2019

创建者 Rúben G

Apr 27, 2020

创建者 Huong M L

Apr 29, 2020

创建者 Fernando L C

Jun 29, 2018

创建者 Nicolas T

Jun 14, 2019

创建者 Prince C S

Sep 5, 2021

创建者 Rishabh T

May 27, 2019

创建者 Daniel P

Jan 19, 2017

创建者 Alexander L

Nov 11, 2019

创建者 Kaan A

Nov 7, 2019

创建者 Janis S

Oct 27, 2020

创建者 Dhruvesh P

Nov 18, 2017

创建者 Alexey P

Mar 8, 2017

创建者 Dilyan M

Dec 10, 2018

创建者 Damian C

Mar 22, 2018

创建者 Jonathan M

May 18, 2020

创建者 GongPing

Aug 20, 2017

创建者 Sergey T

Jun 28, 2020

创建者 Long N

Feb 28, 2021

创建者 Ali İ E

Apr 27, 2022

创建者 Ashish S

Aug 12, 2018

创建者 Ahmad B E

Jun 16, 2017

创建者 Christian K

Apr 25, 2021

创建者 Oleksandr S

Feb 17, 2020

创建者 Anastasia Z

Jan 30, 2018