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

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

4.8
звезд
Оценки: 4,537
Рецензии: 882

О курсе

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

Фильтр по:

351–375 из 863 отзывов о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms

автор: eyes r

12 мая 2018 г.

Outstanding introduction to algorithms with great practice problems and quizzes

автор: Yifan W

23 окт. 2016 г.

It's an amazing courses aiming to high-level and fast-pace algorithmic thinker.

автор: Mafruha C

12 нояб. 2017 г.

This cource is a path of my passion to enjoy the intelligent thought and being

автор: Gaurav K

13 дек. 2016 г.

Sir Tim Roughgarden teaches very straight forward and easy .I like the course.

автор: Rajat N K

14 нояб. 2019 г.

Extremely important course if you are looking to revise your algorithm skills

автор: Mostafa Z

8 нояб. 2019 г.

I have really learned a lot and made me explore different topics

Thanks a lot.

автор: Ramazan U

18 сент. 2017 г.

Great course! Beginners should be ready to put in some serious effort though.

автор: Anton B

19 нояб. 2018 г.

Handwriting is difficult to understand sometimes but the content is awesome.

автор: Armando J B F

19 окт. 2018 г.

Excellent, in-depth course. The use of randomness was indeed 'illuminating'.

автор: shivaranjani g

16 июня 2021 г.

amazing course.learn lot of things. enjoy problem solving using programming

автор: Jiaxiao W

2 мар. 2019 г.

very clear and organized course. I learned a lot from it. Thank you so much

автор: Haochuan W

23 янв. 2019 г.

Best online course I've taken. You can possibly cross out the "online" too.

автор: Stjepan H

22 апр. 2021 г.

One of the best courses I attended. It is difficult, but totally worth it!

автор: Jiangbo W

30 сент. 2019 г.

Appropriate amount of content, but a little hard. After all it's Stanford!

автор: UDAYA B C

16 авг. 2019 г.

Best professor, these concepts helped me a lot in competitive programming.

автор: Aakash S

14 апр. 2018 г.

Concepts are very well explained and the quality of quizzes are top-notch.

автор: D T

13 мар. 2017 г.

I like this course a lot. Going to learn everything in the specialization.

20 нояб. 2016 г.

This is a great course for who doesn't have a computer science background!

автор: BRUCE

23 апр. 2018 г.

Finished part I, keep going! This is one of the best courses in Coursera.

автор: 李培春

5 мар. 2017 г.

автор: Gaurav C

12 окт. 2019 г.

That's the best you can get from any professors out there, with quality.

автор: Николай

13 июля 2019 г.

Very good course. Very hard, very interesting and very useful. Thank you

автор: Gaurav J B

6 февр. 2018 г.

This is really helpful and worth course for deep learning of Algorithms.

автор: Dang N

6 июня 2017 г.

Wonderful course! I enjoy mathematical analysis for algorithm very much.

автор: Saurabh V

18 мая 2020 г.

It takes me too much time to understand but it is simply a nice course.