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

學生對 斯坦福大学 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的評價和反饋

4.8
3,212 個評分
571 個審閱

課程概述

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

熱門審閱

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.

FR

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

篩選依據:

276 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 300 個評論(共 553 個)

創建者 Luiz C

Feb 24, 2018

Great course, very well explained, great material and great exercises, with an engaging teacher: cant be much better than that

創建者 francisco i

Dec 24, 2016

Excellent course. What I valued most about this course was the clarity with which proofs and algorithms are explained. In learning algorithms one really profits from a great professor. Keep in mind that this course involves mathematics for proofs and I believe one has to be really curious about algorithms and dive into proofs to take full advantage of this course. Regarding assignments they are challenging but definitely approachable if you have some experience in programming. My advice: do not get discouraged, this is all about resilience!

創建者 Eric L

Nov 13, 2016

Professor Roughgarden makes algorithms cool. With his passion for the topic you can't help but get excited about it too. I feel like I got a deep understanding of the topics covered versus just learning a recipe to sort an array. Looking forward to more.

創建者 Sindhura

May 30, 2018

Very good course.

創建者 xuwei l

Jun 13, 2018

very good course to revise computer science fundamentals

創建者 NoneLand

Mar 17, 2018

This course is about following topics: large integers multiplication, merge sort, quick sort, master method and Karger's min-cut algorithms.

創建者 鹿由

Nov 03, 2017

best algorithm course I have ever taken!

創建者 hcy

Feb 02, 2017

This is a best algorithm course I have ever done!

創建者 Damian C

Feb 02, 2018

Amazing course, just loved it. First there's the ingenuity of the topics covered. Second, Tim makes an awesome job in delivering those lectures. Very clear, and straight to the point. Aside from learning, I enjoyed this a lot. Many thanks to Coursera and its team for making this available, keep the good work :)!

創建者 Berk B

Apr 27, 2017

I had a great time taking this course. It was a very good course in algorithms that explained the core concepts really well rather than just providing a high level overview. The assignments take some time but it aligns with what the instructor is teaching. The instructor is absolutely excellent because he takes the time to go through the math and iterations which helps to develop a deeper intuition for these algorithms. Looking forward to completing his other courses when I got time.

創建者 yiyefang

Jun 08, 2017

A little hard to understand, but if you have done your preparation readings, it would be extremely helpful!

創建者 Venu V

Jan 18, 2017

It's an amazing introduction to algorithms. I enjoyed listening to the lectures. All the algorithms were explained in detail.

創建者 Qinghua Z

Sep 01, 2017

Great Course. Now I get some idea of the spirit of Algorithms, that is "Can we do better?"

創建者 Ismael S M S

Jan 08, 2017

The ideas from this course are fun.

創建者 雷京颢

Feb 28, 2018

brilliant!

創建者 Subodh C

Sep 03, 2017

Very useful and well presented information.

創建者 Lakshya

Jan 20, 2017

Very good course !

創建者 Alberto C

Dec 10, 2017

Wonderful explanations. The companion book helps a lot to review material and have it always fresh in your mind.

創建者 Rainey C

Mar 14, 2018

Greet!

創建者 BRUCE

Apr 23, 2018

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

創建者 De-Wyse

Nov 26, 2016

Helpfull

創建者 Lin M K

Oct 12, 2017

Probably, the best course to start learning algorithms. It's not too easy, not too difficult. It's just challenging enough for those who want to learn algorithms.

創建者 Charlie Z

Jan 28, 2018

Roughgarden creates a great mental model for algorithms. He explains the ideas that connect them and how they are organized. He doesn't waste your time, hitting the key components in both the math proofs and in explaining the algorithm implementation. The way he teaches in like induction; he uses a super simple example (base case) and abstracts that out to get the general case.

After the course, I *get* algorithms now... (instead of memorizing them, I can see how to deduce them). Thank you!

創建者 Aditya k

Jun 19, 2018

This is an amazing course focusing on some of the important fundamentals required to design the right algorithm to a problem statement. Prof. Tim Roughgarden does a fantastic job in explaining the concepts and catching the attention of the students, while not making the course boring. Thanks Courseera for hosting this course.

創建者 Abhit

Nov 29, 2016

Challenging and fun!