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
Problem-solving Strategies: Sum of Integers (Recursive) Complexity
Description
This lecture revisits complexity and calculates the complexity of a recursive algorithm to find the sum of the first integers, discussing the worst-case scenario, function dependencies, and the equivalence between recursive and iterative complexities.
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.