Problem-solving Strategies 2: Recursion

Related lectures (19)

Page 2 of 2

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

Explores the complexity of calculating binomial coefficients using dynamic programming.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

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

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

Covers the substitution method, Master Theorem, and recursion trees for efficient algorithm analysis.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

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

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.