Divide and Conquer, Sorting and Searching, and Randomized Algorithms
FREE
Add your review
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare9.1/10
(Our Score)
Product is rated as #16 in category Data Structures and Algorithms
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). The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180–acre (3,310 ha) campus near Palo Alto, California, United States.
Instructor Details
Tim Roughgarden
Courses : 5
Votes: 0
Courses : 5
Specification: Divide and Conquer, Sorting and Searching, and Randomized Algorithms

82 reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms
4.4 out of 5
★★★★★
★★★★★
62
★★★★★
15
★★★★★
2
★★★★★
1
★★★★★
2
Write a review
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review Cancel reply
This site uses Akismet to reduce spam. Learn how your comment data is processed.
Price  Free 

Provider  
Duration  22 hours 
Year  2016 
Level  Intermediate 
Language  English 
Certificate  Yes 
Quizzes  Yes 
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
FREE
Joseph C –
really great explanation of the diff concepts
Zengjia Y –
Too theoretical, a bit too far apart from industry.
Yayin C –
Very good! Just hope that the speaker could speak a little bit slower and make the slides clearer…Hard to read the hand writing…
Larsen C –
This course really helped me understand how Divide and Conquer Algorithms work. I liked the programming assignments since they really force you to program it on your own and that is the best way to really master algorithms. It was so helpful, thank you!
Mihir S –
Fantastic experience
Mostafa Z –
I have really learned a lot and made me explore different topics Thanks a lot.
Alexander L –
Very interesting. I learned a lot of new things. 5 stars! Just a few things that could be improved: The video and its audio are not really synchronized (maybe because the video is pretty old) The Quicksort programming assignment was like: 1 hour to program a working Quicksort + 4 hours figuring out how the course creator wants me to count the compares of it as that’s dependent from the implementation. Nowadays there are better solutions to validate whether someone solved a programming task. geeksforgeeks.org and hackerrank.com for example just execute the program with test input. But all in all: Very positive experience.
Jingyuan W –
Great
Ivan C –
It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.
GAURAV R –
The course is not an easy one but if done earnestly will help the learner a lot in developing a mindset for algorithms.
Rajat N K –
Extremely important course if you are looking to revise your algorithm skills
sherif s –
over all is good the proofs parts are too much by the way
wuhanwen –
important concepts very good explained
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.
Francisco N –
Great Course
Can C –
Tim Roughgarden is an exceptional teacher. Didn’t think I’d learn so much in such a short space of time!
Rishiganesh V –
It is Really an amazing Course, mind blowing, very informative, It gives me the complete understanding merge sort and quick with best mathematical analysis.
Antonio S –
Very well done and clear even for people without a computer science background. Strongly suggested to anyone interested in algorithms
Inderpreet S –
Great start in the specialisation of algorithm and data structures.
Steven R –
Good Explain, make me deep understanding
SAGAR D –
Awesome Course.
Dongcai –
Its a very nice course.
Priyam S –
It is an awesome experience.Most likely the programming assignment gives me a boost.And the Karger’s Algorithm problem of minimum cut was nice.It really take a lot of tie to solve and think.But finally I am able to pass it .After all a very good experience.
Nikhil S –
In the very end, it was fun coding the min cut algorithm and overall I enjoyed this
Kevin C P –
Keep up a nice courses!
Yuxing C –
excellent course with clear explanation
Jephte E –
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
Yann F –
Very well designed, structured and delivered. I enjoyed the videos and learned a lot from the lectures, quizzes, forum and programming assignments. Great course.
Chella T N –
Classic course
Yann F –
Very well designed, structured and delivered. I enjoyed the videos and learned a lot from the lectures, quizzes, forum and programming assignments. Great course.
Chella T N –
Classic course
fesri h –
Very Challenging!!!
Vishnu –
Sometimes it became complicated but it was really good
Pablo S –
Very theoretical and lacking of resources. The classes are handwritten, showing very little effort and the forums are dead.
fesri h –
Very Challenging!!!
Vishnu –
Sometimes it became complicated but it was really good
Pablo S –
Very theoretical and lacking of resources. The classes are handwritten, showing very little effort and the forums are dead.
Ravipati A k –
really best lecture
TAI C W –
The idea and the content are excellent in terms of mathematic analysis. I would recommend people who want to do software engineering or computer science to pick up this course. However, I couldn’t give stars higher than three because the videos aren’t cut well; After week 2, a lot of written explanations in the video don’t follow the audio; i.e., The teacher speaks faster than his writing. That is extremely confusing, and I have to go back to the lecture and read the subtitles back and forth a lot of times, to fully absorb the ideas. Otherwise, it’s an outstanding lesson, and I recommend students to download the optional textbooks to get a better understanding.
Ravipati A k –
really best lecture
TAI C W –
The idea and the content are excellent in terms of mathematic analysis. I would recommend people who want to do software engineering or computer science to pick up this course. However, I couldn’t give stars higher than three because the videos aren’t cut well; After week 2, a lot of written explanations in the video don’t follow the audio; i.e., The teacher speaks faster than his writing. That is extremely confusing, and I have to go back to the lecture and read the subtitles back and forth a lot of times, to fully absorb the ideas. Otherwise, it’s an outstanding lesson, and I recommend students to download the optional textbooks to get a better understanding.
Ali I C –
A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.
Ali I C –
A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.
Bento C G –
Amazing course to learn algorithms from scratch.
Bento C G –
Amazing course to learn algorithms from scratch.
Goswami Y –
good course, because it covers all aspects conceptually
Goswami Y –
good course, because it covers all aspects conceptually
John C –
I loved it. It’s challenging. Definitely requires some thought outside of what he videos cover for some of the quiz questions, but still totally doable.
John C –
I loved it. It’s challenging. Definitely requires some thought outside of what he videos cover for some of the quiz questions, but still totally doable.
Mayank K –
Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.
Mayank K –
Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.
Sai L K –
I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.
Arun M –
loved this course. I found this course pretty interesting.
Sai L K –
I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.
Arun M –
loved this course. I found this course pretty interesting.
Shardul –
Great course helps you to understand a lot of concepts and specially the math behind it
Shardul –
Great course helps you to understand a lot of concepts and specially the math behind it
Ozgur P –
One of the best courses I’ve ever done in computing.
Ozgur P –
One of the best courses I’ve ever done in computing.
Yifu S –
Very Nice course,I have got a Master Degree in Computer Science,but i stll learn much new knowledge and thinks from this course.
Yifu S –
Very Nice course,I have got a Master Degree in Computer Science,but i stll learn much new knowledge and thinks from this course.
Vijaya K T –
Course is very good
Vijaya K T –
Course is very good
Rahul K –
This course really give the idea how to approach the problem and analyse it and find the most efficient way to solve it.
Rahul K –
This course really give the idea how to approach the problem and analyse it and find the most efficient way to solve it.
Darin W –
great course and challenging
Derek A S –
Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.
Manol D –
Liked the style and intensity of the course!
Manol D –
Liked the style and intensity of the course!
Derek A S –
Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.
Simon R –
Interesting and well explained. Well done.
Simon R –
Interesting and well explained. Well done.
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.
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.
Soroush –
Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.
Soroush –
Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.
HARSHITA S –
WONDERFUL AND VERY USEFUL LEARNING EXPERIENCE!!!
LIU C –
The instructor is simply super cool in teaching. He managed to explain things with all the necessary details in the most concise language. highly recommended.
Sam S –
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.
Ojas –
One of the best courses without a doubt!. Although some topics course require more deep / comprehensive discussion
Yasar A A –
At first, I found difficulty in catching the content….. it would bounce upon my head rather understanding… overall it was worth of hard work. Good Content
RISHABH H P –
It is a great course, but the person needs to be determined to complete the course, and you will also have to refer to a lot of external materials… Tim tried to make the course as interesting as possible…