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
Complexity of Algorithms
Description
This lecture discusses the complexity of algorithms, focusing on the Big-O notation to analyze the efficiency of algorithms. It covers examples of Big-O estimates for polynomials and the factorial function, as well as combinations of functions. The instructor explains how to abstract from the details of function growth and consider the fastest-growing part for large values.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.