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 GraphSearch.
This lecture covers the basics of Insertion Sort, a simple sorting algorithm compared to organizing a hand of playing cards. It explains the algorithm step by step, including the insertion process and correctness analysis. The instructor also introduces the computational model for predicting algorithm resources and discusses the running time analysis of Insertion Sort. Students are encouraged to ask questions and review fundamental concepts in discrete math and programming basics.
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