Chevron Left
Retour à Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford

4,690 évaluations
907 avis

À propos du cours

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

Meilleurs avis

13 sept. 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 mai 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

Filtrer par :

351 - 375 sur 891 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms


28 avr. 2019

Very interesting course. It also gives me a chance to improve my computer language.

par Difu W

12 avr. 2018

If the words on the screen were typed, the learning experience will be much better!

par Munish a

13 mai 2021

The only thing that can be improved is the lag between the presentation and audio.

par Tanay D

22 sept. 2020

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

par Pavel P

24 mai 2020

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

par Alexandr K

7 avr. 2019

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

par charles

23 nov. 2016

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

par Guillaume D

7 déc. 2020

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

par Anil K M

19 nov. 2017

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

par Daniel H

22 déc. 2016

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

par Adeesh A

1 avr. 2020

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

par Aditya K J

30 mars 2018

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

par Udhayakumar S

31 mai 2017

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

par Kevin H

29 oct. 2020

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

par Eyes R

12 mai 2018

Outstanding introduction to algorithms with great practice problems and quizzes

par Yifan W

23 oct. 2016

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

par Mafruha C

12 nov. 2017

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

par Gaurav K

13 déc. 2016

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

par Rajat N K

14 nov. 2019

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

par Mostafa Z

8 nov. 2019

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

Thanks a lot.

par Ramazan U

18 sept. 2017

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

par George Z

21 juil. 2021

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

par Anton B

19 nov. 2018

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

par Armando J B F

19 oct. 2018

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

par shivaranjani g

16 juin 2021

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