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,574 évaluations
889 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 :

801 - 825 sur 871 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par Joey

1 juil. 2020

Awesome course, I found it very helpful in preparation for my developer interviews.

par Nikhil S

21 déc. 2019

In the very end, it was fun coding the min-cut algorithm and overall I enjoyed this

par Tianyi Z

16 juil. 2018

Quicksort could be better. The comparison counting is not a good assignment I feel.

par Lucas P

1 janv. 2019

The classes are very good but I hope they can improve the programming assignments.

par Osmar P

10 févr. 2021

Extreme well-structured course, but it's really hard to understand the whiteboard

par Dieter V

16 nov. 2020

Very well explained. Good selection of programming assignments and problem sets.

par Sukhesh B

14 nov. 2016

Great course to improve your skills on Algorithms, Space and Time complexities

par Sriram R

13 nov. 2016

Needs hands-on experience with high-school probability to help crack the exams

par Aman S

3 avr. 2020

The instructor wasn't very good at teaching, but the course is designed well.

par Ashish U

25 juil. 2019

really helpful course on building concepts on data structures and algorithms

par Aditya K

29 juin 2018

Tough one, but if you take time to understand ... it is deep and fun as well

par Yusuf K

20 janv. 2018

Excellent set of tutorials. Good questions that require critical thinking.

par Keith M

17 nov. 2020

Good course but make sure your up to speed on probability theory first.

par adham E

3 juin 2020

I thin it can be more easier as its first course in the specialization

par Dharmesh

7 avr. 2020

Very good, Assignment and Quiz. It's help me lot of to clear Concept.

par Fatoumata F

23 avr. 2018

I loved the problem set 1!

Thanks for the book recommendations also

par Hassan N

1 mars 2017

Great course but audio and video are terribly out of sync.

par Giorgi G

13 nov. 2018

Retake videos, because it's hard to watching handwriting.

par sherif s

15 nov. 2019

over all is good

the proofs parts are too much by the way

par Vishnu

31 déc. 2019

Sometimes it became complicated but it was really good

par Yang W

10 mai 2018

very conceptual, not very friendly to the beginner.

par Utsav S

4 juin 2020

excellent ,what i most need was asymptotic analysis

par Anish K

30 août 2017

Very fun, interactive and downright helpful course.

par Yasir M

9 juin 2020

Should be more precise in code. It's too vague

par Dragonphy W

13 oct. 2018

It's good enough but lack of thorough analysis