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.
Lecture
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 complexity of algorithms, focusing on big-O notation for powers, logarithms, and factorials, as well as the efficiency of algorithms in terms of time and space complexity. It also explains big-Omega and big-Theta notations, with examples and summaries.