Zurück zu Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8

2,611 Bewertungen

•

485 Bewertungen

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.

Filtern nach:

von Joshua S

•Oct 03, 2018

I have a degree in CS, but it's been over 15 years, so I took this course as a refresher. I've previously taken Dr. Sedgewick's Algorithms II course (also on Coursera) 4 years ago. Both courses are excellent. The Princeton course has lots of meaty programming projects that are more similar to a traditional data-structures classes. The Stanford course is a little heavier on theory, while remaining very practical. Professor Roughgarden is a fantastic lecturer, and the material is extremely well crafted with lots of fully worked examples of classic problems. While slower than Sedgewick's course, I really needed something that would pound these ideas and concepts into my head, and this course does a great job with that.

von Adam L

•Jun 12, 2017

Pros: Excellent material, well controlled audio of the dictation, quizzes encouraged thoughtful reconsideration of the material.

Cons: Some lectures could be broken down more. I think this would help with attention, retention, and review. The biggest issue was with the programming assignments. The decision made for what to report as an answer to show you've done the work seems to lead to students spending most of the time on what I call "guess the implementation problems" rather than understanding and retaining the concepts. To give a concrete example, on PA#3 I came up with implementations of quicksort that not only properly sorted the array, but did so with less comparisons than the "right implementation" that led to the answer needed for the assignment. My intial implementation was based off of the CLRS book and my own logical understanding of the algorithm. Even after having rewritten based off the suggested pseudocode from the lecture video, there was a lot of room for ambiguity in the implementation. Trying to figure out what implementation I was supposed to have seemed like an endeavor for the sake of points instead of learning, and it took up ~95% of my time spent on the problem. I feel like assignments like this are tedious and discouraging to not only learning but thinking for yourself. Ideally, we would find a way to avoid this problem while still having a way to ensure people did the work.

von Ian D

•Jan 03, 2019

The instructor is simply not good at explaining these concepts. In contrast to the Princeton course his explanations are dense, condescending, and totally removed from the day to day practice of software development. I would not recommend this course to anyone.

von Divij S

•Jan 23, 2018

I have issues with the content/style of this course. My main issue is that the course requires understanding of maths topics to understand the course content, which is fine, and the lecturer provides some review of those topics. However, my main issue/frustration is that a large part of the quizzes is about the maths which the course relies on, not on what is taught in the course itself. In other coursera CS courses, the lecturer uses some maths in explanations/lectures, which requires understanding those maths topics, but then the course does not test you on your understanding of the maths which is not taught in the course - it tests your ability to understand and implement what was taught. I understand the maths well enough that I can follow the proofs provided in the lectures, but there wasn't enough material on the maths to expect me to be able to draw conclusions by performing similar proofs on my own. This made the course quite frustrating. The result is also that though I understand the algorithms taught, if I want an in-depth understanding of the maths, proofs, and analysis, I'll have to study this topic from scratch again from another source, which makes my time spent on this course almost a complete waste.

Additionally, with the way courses are on coursera, its very hard to learn from your mistakes. You either know the answers or you don't. There's no explanation about why your answer is correct/incorrect.

I did learn a lot about algorithms and for the most part the lecturer taught well. My only complaint is that the course is set up in such a way. The content does not include enough about maths and analysis to quiz you almost solely and quite thoroughly on maths and analysis, which it does.

von Sergey S

•Mar 26, 2019

I've taken some other courses but this one provides really complex quizzes/exams that encourage students to learn.

von Bharath K N

•Oct 16, 2018

Very fast paced videos, i had to reduce the speed to 0.75x to understand.

Most of the concepts (math) are omitted from lectures but still the jargon's like "lemma" /"corollary" / "induction"/ "contradiction" are used to confuse the user without much clarity on prerequisites for the course , so in order to understand this i had to resort to other books and come back to this video for understanding.

If you are math skills are meek or you need a refresher , i suggest to pick some basic math book on probability and learn some graph theory before joining this course, trust me you would save a lot of time.

I had to jump between the video and other books, the problems are very challenging.

If you are very good in math basics and already read Intro to Algo's by Cormen, there is no much need of this course.

von Abhilash R

•Sep 19, 2018

MORE OF THEORY LESS OF SOLVING

von Karan S

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

von Matthieu D

•Sep 13, 2018

Interesting and well structured course. The material is basic, but has enough depth to be challenging for someone who, like me, has minimal programming experience. The instructor explains the material very well and is engaging.

A big plus is that, unlike other similar courses, you can apply the material and answer the quizzes with any programming language you see fit.

von 何浩源

•Jul 20, 2019

喵儿额

von Николай

•Jul 13, 2019

Very good course. Very hard, very interesting and very useful. Thank you

von Mario R G

•Jul 12, 2019

Extremely clear and concise.

von Antonio

•Jul 04, 2019

It was my greatest honor to take this kind of course

von Pratik T

•Jul 04, 2019

dgsdg

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

von Xixuan W

•Jun 30, 2019

Generally, this course is great, and it focuses on some core theories of algorithms in Computer Science.

Personally, I think the tricky part is the analysis of the algorithms which requires some advanced math knowledge and a lot of patience.

To be honest, though I have finished this course, there's still a must for me to review the whole course later. Also, I need to implement all the algorithms again in both java and python I guess :)

von Nguyen K T

•Jun 29, 2019

very hard

von Shuvam S

•Jun 28, 2019

I really like the course content and the way professor teaches. Programming assignments are really good as they just don't ask you to code up an algorithm but asks in depth questions like number of comparisons made in each step.

von LAWRENCE S

•Jun 28, 2019

The talking speed of instructor is too fast. Is there a way to slow down via the control?

von HARSHITA S

•Jun 25, 2019

WONDERFUL AND VERY USEFUL LEARNING EXPERIENCE!!!

von Aishwarya R

•Jun 21, 2019

Learnt about Merge Sort, Quick Sort, Randomization Algorithms, Selection, Graphs, Min-cut. Thank you Prof. Roughgarden :)

von andrew

•Jun 18, 2019

Very well done and presented material! In depth and gives you a deeper understanding of the material (if you pay close attention in lectures that is)!

von Dipen K

•Jun 17, 2019

Course was well planed. It would be more better if more graded programming assignments were included.

von Ganna S

•Jun 16, 2019

This is an enjoyable course. Love the lecturer! He's extremely charismatic with very good sense of humor, gives information clearly, explains everything well. And all the knowledge from the course are precious.

von MAHARSHI P

•Jun 14, 2019

such a good course which I had never learned from anywhere

Coursera arbeitet mit erstklassigen Universitäten und Organisationen zusammen, um Online-Kurse anzubieten und dadurch universellen Zugriff auf die weltweit beste Ausbildung zu ermöglichen.