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

4.8

2,969 notes

•

525 avis

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.

Filtrer par :

par DHEERAJ S

•Oct 20, 2018

it's a very good start for someone beginner in this.

par Sushruth

•Aug 19, 2018

Awesome course.

par YX L

•Aug 19, 2018

Very helpful, informative course. The way professor explain the concept is quite straightforward and easy to understand. there are also plenty of exercises to make sure you understand all the details in algorithm.

par Steve J

•Sep 20, 2018

I found this course to be an ideal mix of abstract theory and practical application. Professor Roughgarden is quite adept at presenting in depth analyses of algorithms in a way that does not shy away from formal mathematics but also does not require a degree in mathematics to understand. For me, whose prior math coursework was mainly focused on areas of math not as prevalent in computer science as other in disciplines (e.g. calculus vs. discrete math), Professor Roughgarden's approach is ideal and opened up the door to a much deeper understanding of algorithms than I've acquired on my own over a multi-decade career in programming.

Highly recommend this course for anyone who, like me, has a lot of experience with programming, but no formal training on algorithms.

par rohan k

•Sep 25, 2018

Quiet good paced! Enjoyed the course. Thank you!

par Yiquan L

•Oct 08, 2018

According to completed assignment, I think I get a lot.

par Ivan L

•Oct 23, 2018

it is really great and so so simple as title sounds

par Aditya S

•Oct 25, 2018

awesome

par Nikhil N P

•Oct 27, 2018

loved one

par Babak M S

•Oct 31, 2018

Great course and great instructor.

par Niko G

•Aug 16, 2018

As an Electrical Engineer, until completing this course, I felt a little uncomfortable talking with computer scientists about algorithms, although I have been programming for about 20 years. Now I feel comfortable discussing algorithms. Really enjoyed the course.

par Jayesh K S

•Jul 24, 2018

great course....detailed one

par srivatsan i

•Aug 31, 2018

good organised modules to learn algorithm

par 黃正豪

•Aug 31, 2018

Quizzes and assignments could be challenging but it worth it.

par Nikola G

•Jul 15, 2018

Really strong introduction to algorithms!

par kwadwo a

•Jul 17, 2018

Challenging and enlightening

par Yiming Z

•Jul 17, 2018

A very good course! Just feel excited and motivated to learn algorithms! Now I am determined to be a computer science major in college.

par Chi M

•Jul 11, 2018

The lectures gave me very good direction to study algorithms. Thanks!

par Abhishek C

•Jul 10, 2018

quite good course

par Sriram V

•Mar 06, 2018

Outstanding course. Thoroughly enjoyed it!

par Tyantov

•Nov 17, 2017

Very nice course, thanks Tim!

par YANG Y

•Jun 19, 2017

The best course I've taken on any MOOC by far. I'm satisfied with both its depth and professor's intuitive teaching. Assignments are also challenging, deeply connected to the material. Strongly recommend to any like me who is new to algorithms.

par Rafael E

•Jun 08, 2018

An excellent intro to analysis of algorithms!

par John W

•Jul 08, 2017

Really enjoyed watching the lectures and Prof Roughgarden's explanations. He did a good job diving just deep enough into the math without losing me.

par ryan

•Sep 28, 2017

awesome!