About Course
This is the fourth short course – Divide and Conquer – of the Master Series on the Analysis of Algorithms. In this course, you’ll explore the divide-and-conquer paradigm, learning how to break complex problems into simpler sub-problems for efficient solutions. The course covers real-world applications like the Stock Investment Problem, recursive and iterative Merge Sort, Quick Sort, and advanced techniques like Karatsuba’s Algorithm. You will also explore the lower bounds of sorting algorithms and analyze both randomized and deterministic strategies.
Course Content
Divide and Conquer
-
Divide and Conquer | Stock Investment Problem, Merge Sort( Recursive and Iterative)
01:12:00 -
Divide and Conquer | Lower Bound of Sorting Algorithm, Karatsuba Algorithm
40:00 -
Divide and Conquer | Quick Sort (Randomized and Deterministic)
01:20:00
Student Ratings & Reviews
No Review Yet