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

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

Оценки: 4,260
Рецензии: 802

О курсе

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

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

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.

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

Фильтр по:

201–225 из 782 отзывов о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms

автор: Yiming Z

17 июля 2018 г.

A very good course! Just feel excited and motivated to learn algorithms! Now I am determined to be a computer science major in college.

автор: Jose E N H

6 нояб. 2016 г.

it was awsome!! one of the best courses and materials regarding algorithms i have taken!

thanks a lot!

totally worth my time and money =)

автор: Derek A S

11 февр. 2020 г.

Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.

автор: Can K

29 июля 2020 г.

Excellent course. The instructor thoroughly motivated the concepts and taught the subject in a way that was insightful and enjoyable.

автор: Antonio S

1 дек. 2019 г.

Very well done and clear even for people without a computer science background. Strongly suggested to anyone interested in algorithms

автор: Saurabh M

15 авг. 2017 г.

Well explanatory lectures with challenging programming assignments with a benefit to code in any language. Over all a great course !

автор: Yayin C

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.

автор: 陈禧琛

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.

автор: Jay

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 A 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