Chevron Left
Retour à Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford

4.8
étoiles
4,255 évaluations
802 avis

À propos du cours

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

Meilleurs avis

KS
13 sept. 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
26 mai 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

Filtrer par :

201 - 225 sur 782 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par Yiming Z

17 juil. 2018

A very good course! Just feel excited and motivated to learn algorithms! Now I am determined to be a computer science major in college.

par Jose E N H

6 nov. 2016

it was awsome!! one of the best courses and materials regarding algorithms i have taken!

thanks a lot!

totally worth my time and money =)

par Derek A S

11 févr. 2020

Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.

par Can K

29 juil. 2020

Excellent course. The instructor thoroughly motivated the concepts and taught the subject in a way that was insightful and enjoyable.

par Antonio S

1 déc. 2019

Very well done and clear even for people without a computer science background. Strongly suggested to anyone interested in algorithms

par Saurabh M

15 août 2017

Well explanatory lectures with challenging programming assignments with a benefit to code in any language. Over all a great course !

par Yayin C

2 nov. 2019

Very good! Just hope that the speaker could speak a little bit slower and make the slides clearer...Hard to read the hand writing...

par Yuanzhan W

27 avr. 2019

The course is well organized. Clean introduction to most common sorting algorithms and the math behind them. Strong recommendation.

par 陈禧琛

16 oct. 2017

I benefited a lot from this course, and I learned a lot. I will apply for grants, and continue the study of the following courses

par Yifu S

31 janv. 2020

Very Nice course,I have got a Master Degree in Computer Science,but i stll learn much new knowledge and thinks from this course.

par Beau D

16 nov. 2016

The math in this course is quite difficult, but the professor does a great job of explaining it in a very easily understood way.

par Patrick M

23 nov. 2020

This course provided an excellent mathematical foundation to algorithms I've used and introduced me to some that I didn't know.

par Luiz C

24 févr. 2018

Great course, very well explained, great material and great exercises, with an engaging teacher: cant be much better than that

par Ali S

31 oct. 2017

The course is not as not programming oriented as the Princeton one, but it is a better course in terms of theory and analysis.

par Amarth C

24 août 2017

Professor's awesome, but some part he speaks a little bit fast, for non-native speaker it asks extra work to fully understand.

par Solomon B

11 mars 2017

Excellent course. The statistical analysis was a little too fast and overwhelming towards the end but overall I learned a lot.

par Arjun B

25 juil. 2020

Despite of being an online course i learnt more than i ever could from my current college curriculum. Cheers to the concepts!

par Ehsan F

4 déc. 2018

This course was a real one. The only feeling I had afterwards was that I wish I could meet him in person. He is just awesome.

par Venu V

18 janv. 2017

It's an amazing introduction to algorithms. I enjoyed listening to the lectures. All the algorithms were explained in detail.

par Jay

19 mars 2020

Very Nice course for a newbie like me to mastering algorithms. I want to thank you institute for making this course for us.

par Aishwarya R

20 juin 2019

Learnt about Merge Sort, Quick Sort, Randomization Algorithms, Selection, Graphs, Min-cut. Thank you Prof. Roughgarden :)

par Rahul K

7 févr. 2020

This course really give the idea how to approach the problem and analyse it and find the most efficient way to solve it.

par Aksheshkumar A S

26 mai 2020

really an amazing course and have covered the content very nicely and the programming assignments are also very helpful

par GAURAV R

13 nov. 2019

The course is not an easy one but if done earnestly will help the learner a lot in developing a mindset for algorithms.

par TianJie S

12 mai 2019

very tough and challenging course. The professor explains very detailed mathematics analysis underlying each algorithm