返回到 Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8

3,215 個評分

•

572 個審閱

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

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.

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.

篩選依據：

創建者 Emin E

•Jan 27, 2018

It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.

創建者 Joe

•Apr 29, 2017

As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.

創建者 Chris S

•Mar 08, 2018

I thought the course was well instructed, Tim is a good professor and doesn't give up too many of the answers. I found the probability section needing more review as I didn't come into the course with a statistics background, and I felt that hurt my full comprehension of the material. Other than that, awesome course.

創建者 Sean S

•Jul 22, 2017

A little too much math than what was anticipated, I would have preferred more of why did the CS choose a divide and conquer approach than proofs. The professor talks faster than I can take notes, it's great that we can stop and rewind.

創建者 Anish K

•Aug 31, 2017

Very fun, interactive and downright helpful course.

創建者 Yusuf K

•Jan 20, 2018

Excellent set of tutorials. Good questions that require critical thinking.

創建者 Laxmidhar P

•Jul 01, 2018

This Course was awesome and it can prove benefit to all the students for designing efficient and fast algorithms.

創建者 John Z

•Nov 13, 2017

Sincerely speaking, the lecture is too coarse. It will be more help, if there are more details in lecture. But not only in videos. It is quite waste of time by watching videos one by one. However, by finish this course, I have regained basic algorithm knowledge learned in college.

創建者 Rishi B

•Jun 06, 2018

This was a good course, but it is not for people who want to get work done using algorithms. It is pretty math heavy and requires ample amount of dedication and understanding. Some high standard videos like the ones on Graph Theory was not very well explained, I had to see some youtube videos to get a nice understanding about them.

創建者 S.Avinash

•Dec 22, 2017

Please do not teach graphs before teaching data structures it becomes very tough for students.

創建者 Fanghu D

•Nov 25, 2016

The unique value of taking the course: read and think through the material with guidance and completing its assignments is the efficiency by saving all the search cost would I collect on my own the good and succinct presentation of the knowledge and exercises with solutions (at least correctness checks.) The entire detail of an algorithm is hard to keep afresh in memory and one needs to refresh it from time to time. It is very cost-effective to take a course like this to accelerate the refresh.

創建者 Shouvik G

•Aug 03, 2018

good.but, he is so fast!

創建者 Mohammed S M A

•Sep 17, 2018

Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.

創建者 Dragonphy W

•Oct 14, 2018

It's good enough but lack of thorough analysis

創建者 Duy K N

•Aug 24, 2018

The lecturer explains everything very clearly. All materials are interesting but the assignments are not well-prepared and quite little :( I don't think they can assess learner's understanding and knowledge well enough

創建者 Giorgi G

•Nov 13, 2018

Retake videos, because it's hard to watching handwriting.

創建者 Sandesh K A

•Nov 16, 2018

Perfect start for a NOOB, all algorithms are explained in a detailed way. Only draw back i felt which can be addressed in further version is to include few programmatic assignments, so that developers can relate how the algorithm is translated from mathematical equation to running code.

創建者 Deepika G

•Apr 26, 2019

Loved the content and detailed lectures.

創建者 Nguyen K T

•Jun 29, 2019

very hard

創建者 Xixuan W

•Jun 30, 2019

Generally, this course is great, and it focuses on some core theories of algorithms in Computer Science.

Personally, I think the tricky part is the analysis of the algorithms which requires some advanced math knowledge and a lot of patience.

To be honest, though I have finished this course, there's still a must for me to review the whole course later. Also, I need to implement all the algorithms again in both java and python I guess :)

創建者 Edson A S

•Jul 01, 2019

Great course.

Tim Roughgarden is an incredible teacher.

You'll learn more using Tim's books on the subject, by the way.

創建者 Ashish U

•Jul 25, 2019

really helpful course on building concepts on data structures and algorithms

創建者 Youya W

•Sep 05, 2019

The pace was kind of fast for learners with little base, better to have more reading to facilitate understanding.

創建者 Pablo J

•Aug 28, 2019

understand that this is intended to be cross code language information, but would also be nice to see examples of non-pseudo code and implemented into at least one language

創建者 SERGEJS I

•Aug 31, 2019

I think the course is nice, I have finally understood what the divide and conquer algos are. I like the algo's non-mathematical analysis.

However, I think that the course was overfilled with the complex math which explained significantly worse than actual algos. I like math a lot (my favourite subject), but then the course description should tell about that course contains advanced math, because it is not suitable for everyone.

I also think that a technical task on a quick sort was confusing, it was very difficult to provide a correct answer though the task was simple. I did not like the technical task for the min cut problem. This algorithm available everywhere online, and you must use the pseudo code to implement it (I have not learnt much).