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 analysis of algorithms, focusing on insertion sort. It explains the correctness of the algorithm using loop invariants and running time analysis. The computational model for predicting resources is discussed, along with examples and worst-case analysis.
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