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 time complexity of algorithms, including linear search, bubble sort, binary search, insertion sort, matrix multiplication, tractable problems, non-deterministic polynomial time, exponential time, and various functions' hierarchy. It also includes a quiz with questions about algorithm complexity.