# 学生对 斯坦福大学 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的评价和反馈

4.8
3,824 个评分
698 条评论

## 课程概述

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts)....

## 热门审阅

##### KS

Sep 14, 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

##### DT

May 27, 2020

Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime

## 576 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 600 个评论（共 681 个）

Sep 01, 2018

Good subject to take, however, the rhythm in my opinion is quite fast, and less practical example was given to connect with our real life, the teacher is nice, except for too fluently speaking LOL, I am not a native English speaker, thus I have to reduce the speed of the video, but then, I stepped into sleepy soon, even X 0.75 speed is crazy hypnosis technique. LOL, anyway, those just my own thinking and thanks to the teacher.

May 11, 2020

This course is very good! Every week your are given a programming assignment in wich you have to code some classical algorithms in the language of your preference. Some exercises are difficult to do, but search for help on the forum. The only bad point is that the teacher talks too fast,a lot of time I had too look for better explanations. It's difficul to follow Tim's rithm.

Aug 28, 2017

The discussion forum is basically dead.If you ask a question, you will probably get an answer in two months.The programming assignment is not as well-designed and challenging as the Rice and Princeton algorithm specialization. There is no autograder. You just need to enter the output of the programming assignment. Nevertheless, it takes a thorough and rigorous approach.

Oct 01, 2017

The instructor offers me a very clear explanation on different algorithm designs. The assignments are also thought-provoking and is able to stimulate your brain.

One thing for improvement is the sufficiency of algorithm exercise. It seems the algorithm exercise the course offers is not enough for those who would like to pursue higher challenge in algorithm puzzles.

Feb 18, 2019

Good introductory course: allows to relatively quickly go through the topic without getting stuck in too much detail; hands on assignments are nice and useful. The slides I feel could be further improved to (i) aid rapid understanding, (ii) be more helpful in problem solving and (iii) have a few more maps back to the bigger picture.

Jun 06, 2018

This was a good course, but it is not for people who want to get work done using algorithms. It is pretty math heavy and requires ample amount of dedication and understanding. Some high standard videos like the ones on Graph Theory was not very well explained, I had to see some youtube videos to get a nice understanding about them.

Mar 08, 2018

I thought the course was well instructed, Tim is a good professor and doesn't give up too many of the answers. I found the probability section needing more review as I didn't come into the course with a statistics background, and I felt that hurt my full comprehension of the material. Other than that, awesome course.

May 23, 2018

I really like this course and think that the course is very helpful for me as a non-cs major student to learn more about algorithms.

However, I found it hard to find answers to the quiz and the questions. I tried in the forum but in vain. Might be an improvement of the Coursera system and organization?

Nov 16, 2018

Perfect start for a NOOB, all algorithms are explained in a detailed way. Only draw back i felt which can be addressed in further version is to include few programmatic assignments, so that developers can relate how the algorithm is translated from mathematical equation to running code.

Nov 13, 2017

Sincerely speaking, the lecture is too coarse. It will be more help, if there are more details in lecture. But not only in videos. It is quite waste of time by watching videos one by one. However, by finish this course, I have regained basic algorithm knowledge learned in college.

Mar 23, 2018

I took this course to understand more the approach of problem solving and less the mathematical analysis. To understand why the things the way they are , Its sufficient to understand conceptual analysis, rather than mathematical analysis , at least for me.

Oct 28, 2017

The course is awesome and explained in details of every topic. However, watching the videos alone is not enough and in my opinion, read the book that the course recommended or look on the internet for relevant reference to support your learning.

Jul 22, 2017

A little too much math than what was anticipated, I would have preferred more of why did the CS choose a divide and conquer approach than proofs. The professor talks faster than I can take notes, it's great that we can stop and rewind.

Jun 24, 2018

Yea i think it's good. However, some of the proofs didn't 100% make sense to me and I don't prefer sloppy proofs. I'd like more concrete walkthrough of the proofs. I know that's hard for course that has so much content packed into it.

Apr 17, 2020

It is the best course for the above algorithms that I have seen till date.The pace and problems are just perfect.It produces interest in us to learn more.Atlast the course is not that tough nor that easy it is just amazing.

Aug 24, 2018

The lecturer explains everything very clearly. All materials are interesting but the assignments are not well-prepared and quite little :( I don't think they can assess learner's understanding and knowledge well enough

Mar 31, 2020

It is a great course, but the person needs to be determined to complete the course, and you will also have to refer to a lot of external materials... Tim tried to make the course as interesting as possible...

Jan 04, 2020

A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.

Apr 29, 2017

As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.

Apr 08, 2018

I would like a better balance workload from week to week. In my experience it increase every week, so last week I was in a rush, not even being able to go through the optional material.

Jan 27, 2018

It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.

Aug 28, 2019

understand that this is intended to be cross code language information, but would also be nice to see examples of non-pseudo code and implemented into at least one language

May 09, 2017

Great course for who is seeking to learn new algorithms and their analysis specially the randomized algorithm. but its videos are kind of long compered to other courses.

Nov 13, 2019

It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.

Mar 28, 2019

Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same