Chevron Left
返回到 Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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

4,198 个评分
788 条评论


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)....


Sep 13, 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.

May 26, 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


301 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 325 个评论(共 769 个)

创建者 Gaurav K

Dec 13, 2016

Sir Tim Roughgarden teaches very straight forward and easy .I like the course.

创建者 Rajat N K

Nov 14, 2019

Extremely important course if you are looking to revise your algorithm skills

创建者 Mostafa Z

Nov 8, 2019

I have really learned a lot and made me explore different topics

Thanks a lot.

创建者 Ramazan U

Sep 18, 2017

Great course! Beginners should be ready to put in some serious effort though.

创建者 Anton B

Nov 19, 2018

Handwriting is difficult to understand sometimes but the content is awesome.

创建者 Armando J B F

Oct 19, 2018

Excellent, in-depth course. The use of randomness was indeed 'illuminating'.

创建者 Jiaxiao W

Mar 2, 2019

very clear and organized course. I learned a lot from it. Thank you so much

创建者 Haochuan W

Jan 23, 2019

Best online course I've taken. You can possibly cross out the "online" too.

创建者 Jiangbo W

Sep 30, 2019

Appropriate amount of content, but a little hard. After all it's Stanford!

创建者 Udaya B C

Aug 16, 2019

Best professor, these concepts helped me a lot in competitive programming.

创建者 Aakash S

Apr 14, 2018

Concepts are very well explained and the quality of quizzes are top-notch.

创建者 Dima T

Mar 13, 2017

I like this course a lot. Going to learn everything in the specialization.

创建者 Mohammad N

Nov 20, 2016

This is a great course for who doesn't have a computer science background!


Apr 23, 2018

Finished part I, keep going! This is one of the best courses in Coursera.

创建者 李培春

Mar 5, 2017


创建者 Gaurav C

Oct 12, 2019

That's the best you can get from any professors out there, with quality.

创建者 Николай

Jul 13, 2019

Very good course. Very hard, very interesting and very useful. Thank you

创建者 Gaurav J B

Feb 6, 2018

This is really helpful and worth course for deep learning of Algorithms.

创建者 Dang N

Jun 6, 2017

Wonderful course! I enjoy mathematical analysis for algorithm very much.

创建者 Saurabh V

May 18, 2020

It takes me too much time to understand but it is simply a nice course.

创建者 Putcha L N R

Jun 15, 2018

Amazing course! Best for getting a good mathematical grip of the topic!

创建者 RAJU A

May 6, 2020

Really good. Need prior experience to understand this course for sure

创建者 Chi M

Jul 11, 2018

The lectures gave me very good direction to study algorithms. Thanks!

创建者 Rohit C

Aug 3, 2017

I never expected algorithms can be taught in such an interesting way.

创建者 Tayfun E

Mar 9, 2020

Very hard and difficult course. I am trying to do it with my best...