Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Master method, a theorem used to solve recurrences of the form T(n) = aT(n/b) + f(n). It explains the separating asymptotic bounds and provides examples. The instructor discusses the maximum-subarray problem, optimal solution structure, and algorithmic approaches like brute force and divide-and-conquer. The lecture concludes with a summary of the divide-and-conquer algorithmic paradigm.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace