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 Binary Search
Description
This lecture covers the concept of recursion, focusing on the three key ingredients: termination condition, self-call with smaller data, and recombination. It also explains the calculation of the sum of the first 'n' numbers. Additionally, it delves into the binary search algorithm, detailing the process of searching for an element 'x' in a sorted list using dichotomy.
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.