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
Algorithm Design: Time Complexity Analysis
Description
This lecture covers algorithms, pseudo-code, data inputs, outputs, internal variables, assignments, and instructions. It also discusses time complexity analysis using examples and notations like n², O(n), and f(n)=O(g(n)). The instructor demonstrates how to calculate the time an algorithm takes to execute for different input sizes.
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.