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).
O(n log n) Algorithm for Counting Inversions I
Loading...
Skills You'll Learn
Algorithms, Randomized Algorithm, Sorting Algorithm, Divide And Conquer Algorithms
Reviews
4.8 (5,244 ratings)
- 5 stars82.85%
- 4 stars13.61%
- 3 stars1.86%
- 2 stars0.61%
- 1 star1.04%
JC
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.
FR
Mar 15, 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 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
Taught By
Tim Roughgarden
Professor