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 introduction to logarithms, comparing the growth of functions, algorithmic notations, and the analysis of algorithm travel times. It explains the concept of asymptotic behavior, polynomial growth, and the search algorithms in lists, including linear and binary search.
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