Chevron Left
Вернуться к Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Отзывы учащихся о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms от партнера Стэнфордский университет

4.8
звезд
Оценки: 4,629
Рецензии: 901

О курсе

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

Лучшие рецензии

KS
13 сент. 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 мая 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

Фильтр по:

251–275 из 884 отзывов о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms

автор: Emma

2 нояб. 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...

автор: Yuanzhan W

27 апр. 2019 г.

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

автор: Freja E

18 февр. 2021 г.

The level was perfect for me. The intuitions and the formalities were very clear and the topics were interesting. Fabulous course.

автор: 陈禧琛

16 окт. 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

автор: Yifu S

31 янв. 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.

автор: Beau D

16 нояб. 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.

автор: Patrick M

23 нояб. 2020 г.

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

автор: Luiz C

24 февр. 2018 г.

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

автор: Ali S

31 окт. 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.

автор: Amarth C

24 авг. 2017 г.

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

автор: Solomon B

11 мар. 2017 г.

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

автор: Arjun B

25 июля 2020 г.

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

автор: Ehsan F

4 дек. 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.

автор: Venu V

18 янв. 2017 г.

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

автор: kareem O

3 янв. 2021 г.

This course is so amazing. Even though I am a beginner but I could understand it and everything went as good as I expected.

автор: Alberto M

27 дек. 2020 г.

tim roughgarden was amazing. he is so enthusiast and transmit that to people. great I will delve deeper into this for sure.

автор: PATEL J Y

19 мар. 2020 г.

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

автор: Aishwarya R

20 июня 2019 г.

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

автор: Rahul K

7 февр. 2020 г.

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

автор: Aksheshkumar S

26 мая 2020 г.

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

автор: Gaurav R

13 нояб. 2019 г.

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

автор: TianJie S

12 мая 2019 г.

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

автор: Michal F

13 авг. 2018 г.

Well-balanced course in terms of difficulty, theory level and practicality. Final exam could have been more difficult.

автор: Arju A

30 мая 2020 г.

English got a bit tough for non-native speaker sometimes, but it required brainstorming and that's why a good course.

автор: BHOGIREDDY R

6 авг. 2019 г.

Best Course for Programmers. But this course needs some programming prerequisites to understand the concepts clearly.