Concept

Mutual recursion

Related lectures (17)

Recursion: Understanding Recursive Functions

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

Solving Recurrences and Recursion Trees

Covers techniques for solving recurrences and introduces the Master Theorem.

Solving Recurrences

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Functional Programming: Concepts and Implementation

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

Problem Solving Strategies: General Overview

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

Tail Recursion

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

Algorithm Design: Divide and Conquer

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

Nested Recursive Definitions

Explores nested recursive definitions using environments and the lifting of binary functions to work on values.

Loops: Control Statements and Functions

Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.

Divide-and-Conquer: Merge Sort

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.

Recursion Trees and Matrix Multiplication

Covers recursion trees, the maximum subarray problem, and matrix multiplication approaches.

Matrix Multiplication: Divide-and-Conquer

Covers divide-and-conquer in matrix multiplication, recursion trees, the master method, maximum-subarray problem, and smart algorithm.

Dynamic Programming: Binomial Coefficients

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

Problem-solving Strategies 2: Recursion

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

Understanding Chaos in Quantum Field Theories

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Matrix Multiplication and Divide-and-Conquer Techniques

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Merge Sort: Divide-and-Conquer

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.