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

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

4.8
звезд
Оценки: 4,321
Рецензии: 828

## О курсе

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

Фильтр по:

## 701–725 из 808 отзывов о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms

9 мая 2017 г.

Great course for who is seeking to learn new algorithms and their analysis specially the randomized algorithm. but its videos are kind of long compered to other courses.

автор: Ivan C

13 нояб. 2019 г.

It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.

27 мар. 2019 г.

Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same

автор: Dmitriy M

27 апр. 2018 г.

It would be better to have more test cases linked to programming assengments. Hoppefully, there is a github branch with that already... but better to merge it to here

автор: Justin S

29 янв. 2019 г.

High rank because the instructor really makes the material come alive. Not a 5-star since I wish there was more supporting materials to accompany the course. Thanks!

автор: Mayank K

16 янв. 2020 г.

Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.

автор: Himanshu G

30 дек. 2017 г.

great course but it would be better if you ask students to submit their code and give limits and various test cases like an actual programming contest.

25 янв. 2019 г.

very good teaching of algorithms.however a little help for coding those would be appreciated.(in my case i am dealing with graphs for the first time).

автор: wenqin s

27 мая 2020 г.

Overall experience is well, the probability overview was fast, require deep understanding with probability and statistics in discrete model.

автор: Sergei I

24 мар. 2019 г.

Content is great. But handwriting is hard to understand clearly for non-native english speakers. I expected good quality of presentations.

автор: VIBIN V

28 июля 2018 г.

excellent course

slightly fast paced and optional exercises are challenging . one should solve those as well to get in depth practice.

автор: Saumya S

2 апр. 2020 г.

Teaching is absolutely perfect. (A grade). But the content in this sub-division of the specialization is very much theoretical.

автор: Soroush B

19 февр. 2020 г.

Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.

автор: Mohammed S M A

17 сент. 2018 г.

Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.

автор: Edson A S

9 мая 2020 г.

Great course.

Tim Roughgarden is an incredible teacher.

You'll learn more using Tim's books on the subject, by the way.

автор: Taylor N

12 июля 2018 г.

Good explanations, but more theoretical and math-intensive than practical. Not the best way to prepare for interviews.

автор: Aldo C

14 янв. 2021 г.

Excelente curso, lo deje un tiempo porque no me podía hacer el ejercicio 3 de programación pero fue por no leer bien.

автор: Ojas

28 мар. 2020 г.

One of the best courses without a doubt!. Although some topics course require more deep / comprehensive discussion

автор: Youya W

5 сент. 2019 г.

The pace was kind of fast for learners with little base, better to have more reading to facilitate understanding.

автор: Laxmidhar P

1 июля 2018 г.

This Course was awesome and it can prove benefit to all the students for designing efficient and fast algorithms.

автор: Piotr L

14 февр. 2018 г.

Slightly outdated in terms of slides full of handwriting, but knowledge is laid out perfectly fine. Thanks Tim!

автор: Золотов Д С

24 июля 2020 г.

The handwritten text was a bit of difficult to read. The rest of the course is just exactly what is needed.

автор: Pavlo B

18 янв. 2018 г.

Would be great to have more verbose assignments check results. But still awesome experience and challenge

автор: Rakibullah S

25 мая 2018 г.

Good but some videos on how the algorithms work and the proofs could have been much easier and clearer

автор: Haoran Z

2 июня 2017 г.

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