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: Growth of Functions
Description
This lecture discusses the complexity of algorithms by analyzing the growth of functions. It covers the need for precise counting in algorithm efficiency, examples of predicting time for different problem sizes, the estimation of solving time, the relevance of growth rate, and the use of Big-O notation to characterize algorithm efficiency.
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.