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

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

4.8
étoiles
4,387 évaluations
844 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
13 sept. 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.

DT
26 mai 2020

Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime

Filtrer par :

76 - 100 sur 825 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par Peter P

6 juil. 2020

The teacher is excellent and explained the course very well. I like that the material is concise and straight to the point and offer high level of concepts that is easy to understand. I appreciate that the professor doesn't spoon feed every little detail information so that the student would get a chance to think and fill in the gaps!

par Eric R

3 mars 2021

This is the 3rd algorithms course I've taken and easily my favorite so far. Professor Roughgarden does an excellent job explaining the concepts behind the algorithm without getting lost in the technical details. I'd suggest taking the supplemental lectures if you want a deeper understanding of the material, but they aren't necessary.

par Vishwas D

8 oct. 2020

First, I would like to thanks a team of Stanford for allowing and approving my financial aid for this course. While waiting for the approval I visited the videos and I completed this course in a day. I sincerely thank the team Stanford for arranging such a wisdomic platform for learning the best tools from the Stanford experts.

par Feiyu L

23 avr. 2018

Now I truly understand how to think of algorithm in terms with Recursion applying Divide and Conquer, and how to use Master method to prove an algorithm's complexity. Even though it is more rigorous then what is required for a software interview or engineering project, having the exposure of theory is better than not having it.

par Aditya k

19 juin 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.

par Sivaramakrishnan

25 mars 2020

I came here from the stanford Lagunita course with the same material. It's an understatement to say that I had quite a FUN time. Wonderfully laid out course structure and sometimes a bit lightweight (rightly so) course material. Highly recommend for people with non-CS background. Great (evergreen) intro course to Algorithms!

par Rui C

22 oct. 2017

Really good course on divide and conquer algorithm design approaches. It's a good introduction to the subject of algorithms. The book written from the course and on sale on amazon is a really good support to the videos. It is a clean up transcript with further additions to the material covered and it's well worth the buying.

par Sangeet M D

31 mai 2017

I always had my doubt on whether to choose which course on Algorithm in coursera, The Princeton one or the Stanford one. Though I can weight one above the other, but the flow is which the Stanford one proceed is the best for any lower Intermediate level student to wants to learn the upper fundamentals of Algorithm Analysis.

par Dustin Z

23 sept. 2019

A very good course. More challenging than the machine learning courses I have taken because there is more math and the programming assignments are less directed, but that was a plus as I grew more in my critical thinking and programming skills because I needed to solve the problems on my own. Very happy with this course.

par Hagen T

22 févr. 2018

This is an excellent course on algorithms, that has given me a deeper understanding of the subject.

I am a theoretical physicist using this course as preparation for coding interviews, and the speed, amount of rigor and optional material (the optional theory problems in particular) feel perfect for my learning effort.

par Md. F K

27 sept. 2019

At first, the course may look too fast-paced, but after one or two videos, ample explanations would disabuse oneself of that idea. Highly resourceful lectures, challenging quizzes, and optional problems make this course quite an elegant one. One of my favorite courses. Looking forward to completing the specialization.

par Zhao J

28 déc. 2017

It's just great! The professor is humorous and fantastic! I really love this course, and it had helped me get started in algorithms and data structures. After finishing this course, I have read some part (part I to part IV) of the CLRS book and learned even more! Believe me, this is a good course and worth your time.

par Limber

31 oct. 2017

A really helpful course that help me to dive deep into the algorithms world. The prof is really nice. I thought the book he has wrote is really benefit for my study. I have over 5 years coding experience but it is still hard for me to get that. Some algorithms assignments are really interesting. It's time worthy.

par Masashi M

14 nov. 2016

I was very amazed with his really good lectures. Especially proving each algorithm's correctness and performance was very interesting and stimulated my curiosity. I also need to note that optional videos for probability helped me a lot to understand this course. I would like to recommend my friends definitely.

par Damian C

2 févr. 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 :)!

par Li-Pu C

24 mars 2020

the professor talks about the algorithm of the introduction to the algorithm and overall it is very good because it is very uncommon that people can deliver hard knowledge in a easy way. I would recommend all the foreigners to take this course as their first course on Coursera if you're new to computer science.

par Kaan A

7 sept. 2019

It was great course from Tim Roughgarden. I like his style and explanations. I enjoyed while doing programming assignments and quizzes and final exams. They were designed well. Difficulty is just right for an online course I guess, not more than courses in universities but more than most of the online courses.

par Paras J

4 avr. 2020

The best content and teaching methodology one can find for algorithms. Even the topics that are considered tough were explained in a very smooth and succinct manner. I loved the optional reading material and assignments! Some of the problems were really challenging and fun to solve. Highly recommended!

par Edgar R H P

26 nov. 2018

El curso es realmente agradable y permite obtener conocimientos para la optimización de algoritmos, altamente recomendado para aquellos que ya tienen una base ya formada. Parecería apropiado adaptar un curso similar para profesionales capacitados en otras carreras pero con interés en los algoritmos.

par Sonali P

10 août 2018

An awesome course for learning algorithms in Divide and Conquer Strategy. The lecturer's teaching and lecture content both are world class. The assignments too were worth challenging and confidence boasting. Nice one in case someone needs to grasp at deeper level, the algorithm design and analysis.

par Anton K

10 févr. 2018

This is by far the best course I've ever seen on coursera. I actually had a major in discrete mathematics and algorithms at college, so I had though I only needed to refresh. But I was actually able to learn quite a lot new things and realized that some of the concepts I've had wrong all this time!

par Neelabh S

2 avr. 2020

Great course! Programming assignments are designed very well. Evaluative components properly judge the learning outcome of the course.

As far as the course is concerned, the explanation of concepts is great. Every topic starts from fundamentals which makes it easy to connect and understand.

par Don S

3 déc. 2020

A very interesting and abstract approach to teaching algorithms. Given the course is language agnostic, I chose C# as my language for doing the programming assignments in order to upskill in C# for my new job. This course has also helped me enhance my understanding of key algorithms.

par An N

26 févr. 2018

It can be difficult for beginners. But you definitely learn alot after if you can make it through the end. There are typed pdf lectures included, but recommend to take notes and have the pdf up when watching the lectures because the instructor's handwriting is not very easy to read.

par Seanita T

16 sept. 2019

The ML class was a great prep for this one. I like that this class is taught in Python vs Matlab/Octave. Prof. Ng is excellent as always. Each course solidifies my understanding while also reminding me there is much still to learn. It's challenging but I am thoroughly enjoying it.