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.8
étoiles
3,503 évaluations
625 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

KS

Sep 14, 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.

CV

Jun 11, 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

Filtrer par :

226 - 250 sur 609 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par ZUWEI L

Apr 28, 2019

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

par Difu W

Apr 12, 2018

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

par Alexandr K

Apr 07, 2019

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

par charles

Nov 24, 2016

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

par Anil K M

Nov 20, 2017

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

par Daniel H

Dec 23, 2016

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

par Aditya K J

Mar 31, 2018

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

par Udhayakumar S

May 31, 2017

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

par Isaac S R

May 12, 2018

Outstanding introduction to algorithms with great practice problems and quizzes

par Yifan W

Oct 24, 2016

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

par Mafruha C

Nov 12, 2017

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

par Gaurav K

Dec 13, 2016

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

par Rajat N K

Nov 14, 2019

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

par Mostafa Z

Nov 09, 2019

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

Thanks a lot.

par Ramazan U

Sep 18, 2017

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

par Anton B

Nov 19, 2018

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

par Armando J B F

Oct 19, 2018

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

par Jiaxiao W

Mar 02, 2019

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

par Haochuan W

Jan 24, 2019

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

par Jiangbo W

Sep 30, 2019

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

par UDAYA B C

Aug 16, 2019

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

par Aakash S

Apr 14, 2018

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

par Dima T

Mar 13, 2017

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

par Mohammad N

Nov 20, 2016

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

par BRUCE

Apr 23, 2018

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