学生对 Stanford University 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的评价和反馈
课程概述
热门审阅
SN
Mar 25, 2020
I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!
MK
Sep 14, 2019
This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)
326 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 350 个评论(共 1,019 个)
创建者 Rihards J
•Dec 19, 2020
Great course for those who would like to become better developers and learn basics of data structures and algorithms
创建者 Daniel R
•Aug 16, 2019
Although some concepts were a bit too hard to chew, this is a great start for someone who's new to computer science.
创建者 Pritam B
•Oct 12, 2017
The course is really good. Helping me to grasp the basic concepts of algorithm and to refresh the algorithms skills.
创建者 Janis S
•Sep 25, 2020
excellent content. Learned a lot! Proofs can be a bit dull at times. But that probably simply lies in their nature.
创建者 Aakash K (
•Aug 6, 2020
This was an amazing course and it allowed me to learn complex algorithms and introduced me to algorithmic thinking
创建者 Alan R M
•Jun 7, 2018
It really helped me understand the concept of algorithms. I confess that I have a new perspective of an algorithm.
创建者 Raghusrinivasan J
•Feb 17, 2021
Great course to learn about different algorithm design paradigms and dig into the world of randomized algorithms.
创建者 Garret N
•Oct 14, 2020
Very intellectually stimulating. The problems were thought-provoking and assessed understanding very effectively.
创建者 Garrett M
•May 10, 2018
Great teacher. Coming from a science background myself, I like that the math is not watered down in the analysis.
创建者 Balaji R
•Mar 21, 2020
What an amazing and insightful course. the min algorithm totally blew my mind randomized algo are simply elegant
创建者 Alberto C
•Dec 10, 2017
Wonderful explanations. The companion book helps a lot to review material and have it always fresh in your mind.
创建者 Shinjan T
•Sep 11, 2019
Awesome course. Learnt a lot about the theory behind a randomized algorithm. Karger's min cut was a revelation.
创建者 Shawn M
•Apr 29, 2019
He can tend to go off topic and waste time in an effort to be exactly exact, but other than that, great course.
创建者 placido d b
•Feb 25, 2022
Great, this course is not simply a course on how algorithms are made but the essence of each one is explained.
创建者 Keerthana S
•Jun 22, 2018
The material is explained really well and the programming assignments are challenging but ultimately solvable.
创建者 Влад А
•Oct 12, 2021
Универской математики хватает для понимания (Матанализ незамысловатый + теорвер базовый). Мне понравился курс
创建者 Jorge B
•Oct 14, 2017
Excellent, great explanations and good pace. Exercises quite challenging for a newbie but you'll learn a ton.
创建者 Jiacheng J
•Aug 3, 2017
Slides are concise. By going through all the slides, I'm already able to grab most of the information needed.
创建者 Pedro F G S
•Jul 1, 2020
Some of the homeworks were difficult, but implementing the algorithms is the best way to really learn them.
创建者 yiye f
•Jun 8, 2017
A little hard to understand, but if you have done your preparation readings, it would be extremely helpful!
创建者 Constantin M
•Jun 3, 2017
Great Course! Everyone should take this cousere in order to become a skilled programmer.
Not for begginers.
创建者 Aliaksei P
•May 16, 2017
Amazing course. Tim is a very charismatic lecturer and it is always a pleasure to get back to his lectures.
创建者 Subhashis M
•Jan 9, 2017
Tim Roughgarden teaches with wit and depth. Speaking with idiomatic verve, he injects life into Algorithms!
创建者 Saurav k
•Oct 16, 2022
The materials of the course are very straight forward and brilliantly explained by Sir Tim Roughgarden.