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.
Lecture
Merge Sort: Divide-and-Conquer Approach
Description
This lecture covers the growth of functions and introduces the sorting problem, focusing on insertion sort. It explains the divide-and-conquer approach, illustrating the merge sort algorithm step by step. The instructor emphasizes the importance of proving algorithms correct and analyzing their running time.
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 MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.