返回到 Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University

Divide and Conquer, Sorting and Searching, and Randomized 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).

状态:Probability
状态:Computer Science
中级课程小时

精选评论

SN

5.0评论日期:Mar 25, 2020

I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!

JJ

4.0评论日期:Apr 28, 2017

As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.

RK

5.0评论日期:Jun 14, 2021

A Great course for someone who is a beginner and is really dedicated towards learning Algorithms! I loved the instructor's explanations for the proof of correctness of algorithms.

VP

5.0评论日期:Apr 26, 2020

Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P

NE

5.0评论日期:Nov 6, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

RR

5.0评论日期:Jan 28, 2018

This was going to be a review of material for me, just a refresher. But instead I was exposed to a lot of new concepts and really feel like I got some good experience from it.

KS

5.0评论日期:Sep 13, 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.

II

5.0评论日期:Aug 31, 2017

Amazing course. I learned a lot about algorithms, the implementation of algorithms, time complexity. I also learned a lot about being systematic and purposeful about including any line of code.

DT

5.0评论日期:May 26, 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

MK

5.0评论日期:Sep 14, 2019

This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)

AC

4.0评论日期:Jan 3, 2020

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.

JC

5.0评论日期:Jun 10, 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.