Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Recursion

Related lectures (27)

Problem Solving Strategies: General Overview

Presents methods for problem-solving, emphasizing 'Divide and Conquer', recursion, and dynamic programming.

Dynamic Programming: Binomial Coefficients

Explores dynamic programming through binomial coefficients calculation, emphasizing efficiency and memoization in problem-solving.

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Recursive Algorithms: Divide and Conquer

Explores the concept of divide and conquer in recursive algorithms, exemplified by the Towers of Hanoi.

Problem-solving Strategies 2: Recursion

Explores problem-solving strategies like recursion and divide and conquer methods, with examples such as the Towers of Hanoi.

Recursion: Understanding Recursive Functions

Explores recursion, fixpoints, and procedures in depth, emphasizing understanding recursive functions.

Designing Algorithms: Recursion and Dynamic Programming

Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.

Functional Programming: Concepts and Implementation

Covers the concepts and implementation of functional programming in Scala, emphasizing functions, immutable data, and data abstraction.

Encoding Recursion as Self-Application

Explores lambda calculus, higher-order functions, and recursive function encoding.

Tail Recursion

Covers tail recursion, optimizing functions in Scala for iterative processes and providing examples like tail-recursive factorial.

Tower of Hanoi: Recursion and Dynamic Programming

Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.

Optimizing Recursive Queries

Explores optimizing recursive queries in database systems using Datalog and semirings, discussing the challenges and solutions in data analytics.

Fibonacci Numbers: Recursion and Induction

Explores Fibonacci numbers, rabbit population growth, and recursively defined functions.

Dynamic Programming: Solving Sequential Problems Efficiently

Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.

Lambda Calculus: Church Numerals

Explores Church numerals, Booleans, pairs, recursion, and behavioral equivalence in Lambda Calculus.

Recursion: introduction MOOC: Information, Computation, Communication: Introduction to computational thinking

Introduces recursion in algorithms, focusing on termination conditions and EPFL principles.

Recursively Defined Sets and Structures

Explores recursively defined sets, natural numbers, strings, functions, string concatenation, and well-formed formulae.

Safe Mutation in Scala

Explores safe mutation in Scala, emphasizing the management of mutable state and its significance in interactions, modeling, and implementation efficiency.

Records and Variants

Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.

Functions in C++: Basics and Recursion

Covers the basics of functions in C++, including recursion and memory organization.