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,691 évaluations
907 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 :

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

par Chenglei S

26 août 2017

Very clear explanation. Contents covered are helpful for understanding time complexity analysis.

par Hari K

2 juin 2021

E​xcellent course for people who already have had a basic course in algorithms/data structures.

par Prince C S

9 sept. 2021

Great Pace - good examples - always going to the point - clear and providing good information.

par Wenlei Y

16 juin 2020

Great course! You will learn to think algorithmically as well as practice programming skills!

par Luv S

14 sept. 2017

Amazing course! Really hard, but it was worth seeing all that mental effort come to fruition.

par Xiaoxuan

24 juil. 2017

Great class! Very clear mathematical explanations and challenging (but rewarding) assignments

par Manoj B

11 juin 2017

Great course for revision of the concepts! Great lecturer and the quiz questions are superb!

par Farruh H

11 avr. 2018

It was very nice experience I have taken from this course. It improved my algorithms skills

par Yixian H

11 mars 2018

Though final coding assignment has a little difficult, it's a definitely fantastic course!

par Zhu L

19 oct. 2019

This specialization really put an emphasis on algorithm analysis, I like and respect that.

par Qinghua Z

1 sept. 2017

Great Course. Now I get some idea of the spirit of Algorithms, that is "Can we do better?"

par 晓-

7 sept. 2020

我的算法只是很少,因此从第三周学起来有些费劲,不过还是慢慢摸索出来了。大部分时间都是看的老师的书,感觉视频和书有很多重合的部分。整体来说,我感觉长见识了,突然间更觉得数学有用了。

par Brian C

12 oct. 2020

10/10 course,

Content, explanation , it's great.

Not even gonna mention professors voice.

par Yanan L

3 avr. 2018

Very good course on analysis of algorithms. The design side can be a little weak though.

par Nathan H

16 janv. 2018

Challenging and insightful. Provides a great understanding of the math behind the code.

par Onkar M

9 déc. 2017

Great course for Algorithms - Fast and instant delivery of concepts, really liked it ...

par Vrushank p

2 mars 2020

That was amazing experience, I recommend this course for every one excepting beginners.

par shardul k

24 janv. 2020

Great course helps you to understand a lot of concepts and specially the math behind it

par Dylan L

31 juil. 2021

Clear explanation of each algorithm and well-organized homework really help me a lot !

par Yunfan Z

22 juil. 2020

Pretty good modules offered which have strengthed my fundamental skills in algorithms

par Jon S

5 déc. 2018

Great problems, level is perfect for formalizing Do-It-Yourself programming knowledge

par Shalini M

10 sept. 2020

Great course and instructor! the course helps you gain intuition behind algorithms.

par Junzhou J

17 janv. 2017

The course was quite useful and enlightening!I was a good start to learn algorithms!

par Sai R

19 nov. 2016

This course has some great quiz questions. I'd recommend it to people just for them.

par AKSHAT M

9 mars 2021

Best algorithms course ! Totally loved it. Tons of respect for Tim Roughgarden sir.