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).
- 5 stars83.07%
- 4 stars13.67%
- 3 stars1.82%
- 2 stars0.56%
- 1 star0.86%
來自DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS的熱門評論
Challenging and eye opening to algorithm design paradigms. As a code writer for data analysis in a scientific field, this course really motivated me to delve deeper in this rich field.
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.
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.
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.