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,389 évaluations
845 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

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.

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 :

326 - 350 sur 825 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par Eyes R

12 mai 2018

Outstanding introduction to algorithms with great practice problems and quizzes

par Yifan W

23 oct. 2016

It's an amazing courses aiming to high-level and fast-pace algorithmic thinker.

par Mafruha C

12 nov. 2017

This cource is a path of my passion to enjoy the intelligent thought and being

par Gaurav K

13 déc. 2016

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

par Rajat N K

14 nov. 2019

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

par Mostafa Z

8 nov. 2019

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

Thanks a lot.

par Ramazan U

18 sept. 2017

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

par Anton B

19 nov. 2018

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

par Armando J B F

19 oct. 2018

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

par Jiaxiao W

2 mars 2019

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

par Haochuan W

23 janv. 2019

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

par Jiangbo W

30 sept. 2019

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


16 août 2019

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

par Aakash S

14 avr. 2018

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

par Dima T

13 mars 2017

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

par Mohammad N

20 nov. 2016

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


23 avr. 2018

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

par 李培春

5 mars 2017


par Gaurav C

12 oct. 2019

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

par Николай

13 juil. 2019

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

par Gaurav J B

6 févr. 2018

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

par Dang N

6 juin 2017

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

par Saurabh V

18 mai 2020

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

par PLN R

15 juin 2018

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

par RAJU A

6 mai 2020

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