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.
Algorithmic Complexity: Travel Time Analysis
This lecture covers topics such as control operations, data manipulation, algorithmic complexity, function calls, and travel time analysis. It explains how to find the maximum of a list, calculate the greatest sum of two distinct elements, and analyze the travel time of algorithms. The lecture also delves into the asymptotic behavior of algorithms and the visualization of mathematical functions using the matplotlib module.
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