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

4.8

星

3,341 個評分

•

592 條評論

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.

篩選依據：

創建者 Ali I C

•Jan 04, 2020

A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.

創建者 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.

創建者 Gonzalo G E

•Apr 08, 2018

I would like a better balance workload from week to week. In my experience it increase every week, so last week I was in a rush, not even being able to go through the optional material.

創建者 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.

創建者 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

創建者 Ahmad B E

•May 09, 2017

Great course for who is seeking to learn new algorithms and their analysis specially the randomized algorithm. but its videos are kind of long compered to other courses.

創建者 Ivan C

•Nov 13, 2019

It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.

創建者 Madhumala J

•Mar 28, 2019

Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same

創建者 Dmitriy M

•Apr 28, 2018

It would be better to have more test cases linked to programming assengments. Hoppefully, there is a github branch with that already... but better to merge it to here

創建者 Justin S

•Jan 29, 2019

High rank because the instructor really makes the material come alive. Not a 5-star since I wish there was more supporting materials to accompany the course. Thanks!

創建者 Mayank K

•Jan 16, 2020

Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.

創建者 Himanshu G

•Dec 30, 2017

great course but it would be better if you ask students to submit their code and give limits and various test cases like an actual programming contest.

創建者 aditya s c

•Jan 26, 2019

very good teaching of algorithms.however a little help for coding those would be appreciated.(in my case i am dealing with graphs for the first time).

創建者 Sergei I

•Mar 24, 2019

Content is great. But handwriting is hard to understand clearly for non-native english speakers. I expected good quality of presentations.

創建者 VIBIN V

•Jul 28, 2018

excellent course

slightly fast paced and optional exercises are challenging . one should solve those as well to get in depth practice.

創建者 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.

創建者 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.

創建者 Taylor N

•Jul 12, 2018

Good explanations, but more theoretical and math-intensive than practical. Not the best way to prepare for interviews.

創建者 Youya W

•Sep 05, 2019

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

創建者 Laxmidhar P

•Jul 01, 2018

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

創建者 Piotr L

•Feb 14, 2018

Slightly outdated in terms of slides full of handwriting, but knowledge is laid out perfectly fine. Thanks Tim!

創建者 Pavlo B

•Jan 18, 2018

Would be great to have more verbose assignments check results. But still awesome experience and challenge

創建者 Rakibullah S

•May 25, 2018

Good but some videos on how the algorithms work and the proofs could have been much easier and clearer

創建者 Haoran Z

•Jun 02, 2017

Great algorithm course, definitely helps people who find reading an algorithm book too boring to read.

創建者 S.Avinash

•Dec 22, 2017

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