Вернуться к 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

Фильтр по:

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

автор: Tanay D

22 сент. 2020 г.

Really good course , people with basic programming knowledge will love this course

автор: Pavel P

24 мая 2020 г.

Great course! Very good and clear explanations, really good math. I will continue.

автор: Alexandr K

7 апр. 2019 г.

Great in-depth explanation of algorithm analysis, good examples of learned topics!

автор: charles

23 нояб. 2016 г.

Very good course on algorithms, a lot of terms explained in details with exercises

автор: Guillaume D

7 дек. 2020 г.

Really interesting, well explained and challenging, can't wait to see what's next

автор: Anil K M

19 нояб. 2017 г.

One of the best courses on Divide & Conquer and Randomized Algorithms on the web.

автор: Daniel H

22 дек. 2016 г.

Excellent course! I would recommend it to everyone who wants to learn algorithms.

1 апр. 2020 г.

Great explanation . All the algorithms are thought with proof of time complexity

30 мар. 2018 г.

A comprehensive courses with details on correctness,implementation and analysis.

автор: Udhayakumar S

31 мая 2017 г.

Understood very much about random algorithms. Appreciate the rigour in analysis.

автор: Kevin H

29 окт. 2020 г.

Great Course for really diving into data structures and algorithms. Thanks Tim!

автор: 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.

автор: George Z

21 июля 2021 г.

The graph theory part is kind of confusing and might need more explanations.

автор: 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'.

автор: Shivranjani 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!