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
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 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.