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 introduces the concept of time complexity, focusing on determining the worst-case time complexity of algorithms by analyzing the number of basic operations. It covers the abstraction of computational complexity from implementation details, the relationship between time complexity and the number of operations, and the ease of analyzing worst-case complexity.