Master Theorem - Divide and Conquer - Algorithms Part 3
This lecture provides a brief introduction into divide-and-conquer algorithms, with a specific focus on employing the Master Theorem to compute the runtime of such algorithms. The next two videos will focus on two specific examples of useful applications of divide and conquer.
Timestamps:
00:00 Introduction
01:01 Master Theorem
04:55 Master Theorem Examples
07:11 Conclusion
#divideandconquer #algorithms #mastertheorem #recursion #recurrence #timecomplexity #computerscience