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).
Quicksort: Overview
Loading...
Skills You'll Learn
Algorithms, Critical Thinking, Theoretical Computer Science, Computer Programming, Mathematics, Mathematical Theory & Analysis, Divide And Conquer Algorithms, Programming Principles, Problem Solving, Sorting Algorithm, Randomized Algorithm
Reviews
4.8 (5,293 ratings)
- 5 stars82.78%
- 4 stars13.58%
- 3 stars1.87%
- 2 stars0.62%
- 1 star1.13%
II
Sep 1, 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.
FR
Mar 16, 2017
Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec
From the lesson
Week 3
The QuickSort algorithm and its analysis; probability review.
Taught By
Tim Roughgarden
Professor