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

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

4.8
2,975 notes
527 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 :

176 - 200 sur 511 Examens pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par Jamie J S

Jan 01, 2017

I'm so glad that I've taken this course. This is really fantastic.

par Ankit A

Nov 01, 2016

This is great course

par Subhajit S

Mar 27, 2018

The instructor was excellent. His way of teaching was really good

par Bridget L

Jul 23, 2017

The content is absolutely amazing and thought-provoking. Though I am still on the free trial I have to say that from what I have learnt I know the dollars will be worth it.

par Isaac S R

May 12, 2018

Outstanding introduction to algorithms with great practice problems and quizzes

par Onkar N M

Dec 09, 2017

Great course for Algorithms - Fast and instant delivery of concepts, really liked it ...

par Nikolaos E

Nov 07, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

par Frank Z

Apr 22, 2018

Extremely great teach!!!

par HIMANSHU T

Mar 04, 2018

Good Course

par Dang N

Jun 06, 2017

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

par Fabien T

Jun 02, 2017

Outstanding! I've learned a lot during the past 5 weeks spent on the videos, quizzes and assignments. Thanks a lot to Tim Roughgarden for putting together this excellent course and to the Coursera team for hosting it.

par Ankit A

May 24, 2018

An in-depth course, that one must take!

par Jianghua F

Sep 15, 2017

NICE COURSE

par Mingzhe H

Sep 25, 2017

Very good.

par Minyue D

May 14, 2017

Really love this course! Although the quiz might be a little hard but they are definitely doable!

par Ian E

Apr 10, 2017

Professor Roughgarden explains everything clearly and is engaged in the topic. His excitement about algorithms comes though in his teaching.

par CarlosTsui

Jul 13, 2017

good!

par 李培春

Mar 05, 2017

老师讲课的方式挺独特的(与中国的课堂相比),不过很容易接受。有些视频是没有中文字幕的,在没有字幕的情况下,有点跟不上老师的语速。讲得很清晰,很喜欢

par Yixian H

Mar 11, 2018

Though final coding assignment has a little difficult, it's a definitely fantastic course!

par Zhitong Y

Feb 26, 2017

A very nice course!

par Chris G

Nov 01, 2017

Fantastic.

par wileyzhao

Apr 22, 2018

j精彩的课程,重新更深入的了解了一些常见算法,特别是算法的证明与推导,很赞

par Yifan Z

Jan 28, 2018

Really learn a lot from this course

par Vikas D

Dec 16, 2016

Awesome,right now I know why algorithms are most important..!!

par Ali S

Oct 31, 2017

The course is not as not programming oriented as the Princeton one, but it is a better course in terms of theory and analysis.