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.
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
創建者 Nikhil S•
This course taught me the fundamentals of algorithm analysis and how to design divide-and-conquer, sorting, and randomized algorithms. I would recommend this course to anyone interested in getting their start in algorithm design.
創建者 Shuvam S•
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.
創建者 Mariia B•
This course has often been difficult for me, which means I learned a lot. Many-many thanks to Prof. Roughgarden for the challenging topics so nicely explained, and to all the mentors and fellow students from Discussion forum :)
創建者 Abhinaya N•
Pretty amazing course. The book "Algorithms Illuminated" by Dr. Tim Roughgarden makes you greedy to learn more about algorithms. Some of the analogies he presented to explain the concepts were hilarious and makes it a fun read.
Quite interesting and the right level of challenge in my case. The explanations are very clear and to the fact. The exercises that let you implement the algorithms completely on your own improve your autonomy in programming.
創建者 Shubham D•
It was incredulous experience for me. From this course I get to know the level of problems to solve.
obviously, this would not happen without Coursera's scholarship program. Thanks a lot coursera for this marvelous experience.
Professor Roughgarden managed to explain all the algorithom ideas in a clear and simple way, and give us a very intuitive understanding of these methods. He did give me confidence in this field, even I am not majoring in CS.
創建者 Pawel K S•
Professor Roughgarden makes complex algorithm topics easy to understand. He gives a thorough foundation for each topic, and concisely explains proofs. This course has given me a robust framework for algorithmic analysis.
創建者 Güneş A•
I think the instructor is teaching very well. The supporting book is very useful to catch up the course content, and the problems and computational work is quite satisfactory to throughly understand the course material.
創建者 Vinayak G B•
Teaching is excellent . But assignments could have been more challenging with more number of questions and also a bit more tougher ones. Like , if the theory questions were transformed into programming assignments ....
創建者 Tighe B•
This course is well structured and concise. Interesting applications of theory are discussed, along with logical explanations. The course is definitely suited to an intermediate audience, and moves with a steady pace.
創建者 Prakhar K•
The Course Offered has been Amazing! I really Learnt a lot from this Course and though I now know about Algorithms. I'll be coming back for references in the Future! Many things in the Video cannot be match elsewhere.
創建者 Fabien T•
Outstanding! I've learned a lot during the past 5 weeks spent on the videos, quizzes and assignments. Thanks a lot to Tim Roughgarden for putting together this excellent course and to the Coursera team for hosting it.
創建者 Abdul S•
this course helped me a lot and overcomes my lack and confusions in algorithms. The best course for those who want the best way to know more about algorithms and want to implement in programming techniques. loved it.
創建者 Sayan P•
The course was awesome! The professor teaches in a way that he explains how to make the mathematics of the algorithm from scratch and enforces the mind of a learner to code the mathematics. One of the best courses.
創建者 Christopher J V•
I really enjoyed this course and felt that everything was laid out understandably. I would have enjoyed some more programming problems, but felt that the ones given were useful in helping to enhance understanding.
創建者 YX L•
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.
創建者 Adam F•
The course was pretty good. Definitely worth the money, and better than I expected from an online course. I thought it was a little heavy with probability proofs, but that's probably because I struggle with stats.
創建者 DeepCrawl E•
The only criticism I would give is that I feel the estimated time to complete each week is drastically understated. I put close to 15 hours of work into the final week (even though the estimation says 5-8 hours).
創建者 M S K V•
The course is amazing. The quality of the content is just mesmerizing. and a small tip for the guys who are considering to take this course "Please learn Discrrete Probability and Graphs in Discrete Mathematics".
創建者 Ganna S•
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.
創建者 Barunkumar M•
All the core concepts covered in depth and with practical implementation in quiz. i learned not only the core concepts but also how to frame it in real world problems using java programming language.Thank you :)
創建者 YEH T P•
Processor Tim is interesting, and the explanation of why the algorithm work is easy to understand. This course is suitable for who know how to program and want to solve problem more efficiently, more elegantly.
創建者 Pavlos C•
Nice approach by Tim. First explains the problem, then the need to the math pops up and then the math naturally arise. Thus no need to memorize any formula, but should be able to derive anything just by logic.
創建者 navin m•
Great Course!! I had always been a reluctant to jump into analysis of Algorithms. This course helped me get over that and become comfortable analyzing and understanding algorithms.
Thank You, Prof Roughgarden.