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
Recursion and Induction: Proving Algorithms Correctly
Description
This lecture covers the concepts of recursion and induction, focusing on proving the correctness of recursive algorithms through mathematical induction. It explains the differences between recursion and iteration, illustrating with examples like the Fibonacci function and iterative algorithms for computing Fibonacci numbers.
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.