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,629 évaluations
901 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 :

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

par Haoran Z

2 juin 2017

Great algorithm course, definitely helps people who find reading an algorithm book too boring to read.

par tanish s

17 avr. 2020

accent is difficult to understand for indian students. course is very helpful to grab deep knowledge.

par Heather F

11 sept. 2020

Great course. It would be nice if there was more detailed feedback on the assignments and quizes.

par S A

22 déc. 2017

Please do not teach graphs before teaching data structures it becomes very tough for students.

par Irene J

11 avr. 2020

It is a little bit hard for people who only have Python background, but still pretty good.

par LAWRENCE S

28 juin 2019

The talking speed of instructor is too fast. Is there a way to slow down via the control?

par Andres M H C

9 janv. 2021

Very nice course. The professor speak really fast but the subtitles are really helpful

par CHANDAN K S

5 mai 2020

instructor speed of telling the concept is very fast so kindly please take care of it.

par Shubham r

24 août 2019

It was a great course and I loved joining this. Clearing my many theoretical concepts.

par Rui Z

12 janv. 2019

Very good course! Clear explanations and proofs to help you understand the algorithms.

par Priyanshu J

4 avr. 2020

I would appreciate if implementation of algorithms is also included with this course.

par Rohan K

12 sept. 2020

The instructor was really really fast. Grasping the concepts was a little difficult.

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.