Seed Programming

School of Seed Programming Logo

4. Divide and Conquer

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This is the fourth short courseDivide 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.

What Will You Learn?

  • Divide and conquer techniques
  • Stock Investment Problem solution
  • Recursive and iterative Merge Sort
  • Sorting algorithm lower bounds
  • Karatsuba’s multiplication algorithm
  • Randomized and deterministic Quick Sort

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
No Review Yet
Open chat
Hello 👋
Can we help you?
Need more information about 4. Divide and Conquer