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 concepts of recursive sorting algorithms, focusing on Merge Sort. It explains how Merge Sort works by iteratively splitting a list into two sublists and merging them in increasing order. The complexity of Merge Sort is analyzed, showing that it has a linearithmic complexity, which is the best complexity for sorting algorithms.