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: Sorting Algorithm
Description
This lecture covers the merge sort algorithm, which recursively divides a list into two sublists, sorts them, and then merges them back together. The correctness of the algorithm is explained through inductive arguments and base cases. The lecture also discusses the travel time complexity of merge sort and compares it with other sorting algorithms like quicksort and insertion sort.
Official 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.