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 concepts of worst-case complexity, complexity classes, tractability, and P/NP. It includes examples of algorithms like linear search, binary search, bubble sort, and insertion sort. Mathematical induction and recursion are explained with examples.