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

https://mediaspace.epfl.ch/media/0_voeh147s

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms, Data structures

Related lectures (50)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.