Divide and Conquer, Sorting and Searching, and Randomized Algorithms(으)로 돌아가기

4.8

별점

3,831개의 평가

•

700개의 리뷰

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.

May 27, 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

필터링 기준:

교육 기관: 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.

교육 기관: Manuel V

•Aug 08, 2019

This course immersed me in the fundamentals of one of the most interesting and useful problem solving methods in computer science.

Each problem assignment is so carefully thought out, that it forced me to apply what I learned and constantly ask myself "could I do better?"

Very well combined with historical reviews and mentions of the "protagonist of the week", which enriches the learning and made me get closer to the way of thinking of those who pushed our beloved computer science.

교육 기관: Yohan S

•Jan 04, 2018

This was perfect introductory class for me to begin my learning on algorithm. As the instructor said at the introduction, many of the algorithms were fun and challenging and the explanation of the instructor was great. Although the fact which the Programming Assignments do not check the actual code but the final output was the only downside of this class, everything else is great for checking one's understanding of the course.

교육 기관: Sophie Z

•Jun 26, 2017

This course not only taught me some basic concepts of algorithm but also taught me how to analyse the underneath disciplines as well as how to manipulate them. The analysis using probability seems complicated at first, however, the instructor managed to illustrate it in an easy way. I especially love the assignments, they are very enlightening. The test cases in the forum is also of great help in my debugging process.

교육 기관: Ethan h

•Dec 12, 2017

I would probably still be fascinated by algorithms without the enthusiasm of these lectures, but it certainly helps. The discussion forums don't seem to be too busy these days, but enough people have taken this course over the years that I'm sure any stumbling blocks along the way have already been navigated somewhere in the archives. Anyone who enjoys puzzle-solving and analysis should appreciate this course.

교육 기관: Ellen Y

•May 06, 2017

The instructor speaks very clearly and describes everything in a good amount of detail. There were quizzes throughout lectures that keep you engaged and test your understanding, and I liked that I could use the problem sets as a way to practice since there's no penalty for multiple tries. I really enjoyed the course and would highly recommend it to anyone looking for a solid understanding of algorithms.

교육 기관: Jonathon P

•Oct 09, 2018

I am a professional software engineer and I've made it through week 3 of this course so far. The lectures are well done, easy to follow, and it feels like a 1-on-1 tutoring session with one of the world's top professors.

I already feel like I have grown as an engineer after implementing merge sort to find array inversions (among other exercises and assignments). I can't wait to see what's next!

교육 기관: Ashish D S

•Aug 01, 2018

Excellent course on Algorithms. I have done few UCSD algorithm courses before (I equally liked them as well), this course is more focused on Mathematical part. Programming assignments are probably simpler as compared to UCSD course but quiz are hard and requires considerable knowledge of probability and combinatorics. Better to do this course after some basic course on discrete mathematics.

교육 기관: Matt R C

•Nov 09, 2017

Absolutely not what I expected. The instructor is excellent, you can tell his passion about what he is teaching and he presents it great. That being said, this course is way more difficult than what I expected, so be prepared to put in some time and effort to get the most out of it. The material definitely stuck, I'll never look at algorithms the same way again, that's for sure1

교육 기관: Sam S

•Mar 28, 2020

A very thorough and rigorous beginning to algorithms. Professor Roughgarden does an excellent job walking through everything in a clear and succinct fashion. There isn't too much programming needed, but it can be tricky if you aren't familiar with how to operate on various data types. A good understanding of high school math (algebra in particular) will help you in this course.

교육 기관: GongPing

•Jun 11, 2017

These lectures are incredibly mind-blowing, full of insights for algorithm designs and valuable suggestions. This course is really a great enjoyment to follow, because the lectures & quiz & programming assignments are so well arranged! Wish I had took this lectures earlier. Thank you very much Prof Tim Roughgardern for providing the world with such an excellence on-line course!

교육 기관: kumar d

•Apr 21, 2018

This is the best thing to happen for learning algorithms (close second would be the book by steven skiena). This course took me 13 years back to my college 2nd year when I fell in love with algorithms. This is like living your first love all over again. Thank you professor Roughgarden, and I hope you create another course with advanced algorithms with latest developments.

교육 기관: Stefan T I

•Dec 25, 2016

This course offers one of the best introductions to reasoning about algorithms in a mathematical way. However, it is not just theory, it also gives you practical advise and forces you to polish up your programming skills as well by implementing some of the most useful and popular algorithms for sorting and similar applications in whatever language you wish.

교육 기관: Md A R

•Apr 08, 2018

The course is awesome. But the video quality could be improved specially those with echos. It would help concentrating. I have completed algorithm as a undergraduate course and this course is to revisit those area where I had some minor weakness. And this course really helped me building an strong understanding on those points. Overall experience is good.

교육 기관: Stefanos L

•Oct 31, 2017

Very well structured. The lecturer/resources/customizable speed etc are excelllent. I only found the programming assignments too difficult (especially the 4th one) and I had to revert (more than I wanted) to internet sources to do them (or it, especially the 4th one). In contrast, the quizzes were too easy. Perhaps personal taste. Excellent work overall.

교육 기관: Feiyu L

•Apr 23, 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.

교육 기관: 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.

교육 기관: Sivaramakrishnan

•Mar 25, 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!

교육 기관: Rui C

•Oct 22, 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.

교육 기관: Sangeet M D

•May 31, 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.

교육 기관: Dustin Z

•Sep 23, 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.

교육 기관: Hagen T

•Feb 22, 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.

교육 기관: Md. F K

•Sep 27, 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.

교육 기관: Zhao J

•Dec 28, 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.

교육 기관: Limber

•Oct 31, 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.