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).
About the Course
Loading...
Skills You'll Learn
Algorithms, Theoretical Computer Science, Computer Programming, Critical Thinking, Mathematics, Problem Solving, Mathematical Theory & Analysis, Programming Principles
Reviews
4.8 (5,224 ratings)
- 5 stars82.88%
- 4 stars13.61%
- 3 stars1.83%
- 2 stars0.61%
- 1 star1.05%
EE
Invalid date
It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.
TD
Invalid date
This course was outstanding! Big thanks to Tim for explaining difficult concepts in a clear and concise fashion. I can't wait to get started on the next course in this specialization!
From the lesson
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
Taught By
Tim Roughgarden
Professor