Concept
Recursion (computer science)
Related lectures (115)
Recursively Defined Functions
Introduces recursively defined functions and demonstrates how to compute values and prove properties using mathematical induction.
Matrix Multiplication: Divide-and-Conquer
Covers divide-and-conquer in matrix multiplication, recursion trees, the master method, maximum-subarray problem, and smart algorithm.
Encoding Recursion as Self-Application
Explores lambda calculus, higher-order functions, and recursive function encoding.
Recursive Functions: Substitution Interpreter
Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.
Recursion: introductionMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Introduces recursion in algorithms, focusing on termination conditions and EPFL principles.
Loops: Control Statements and Functions
Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.
Parallel Programming in Scala: Computing p-norm
Explores computing p-norm using parallel programming in Scala and its impact on performance.
Solving Recurrences and Recursion Trees
Covers techniques for solving recurrences and introduces the Master Theorem.
Tail Calls: Optimization Techniques
Explores tail call optimization in functional programming, discussing trampolines, Baker's technique, and more.
Implementation of Singly Linked Lists
Covers the implementation of singly linked lists in Java, focusing on concepts such as nodes, size management, adding, removing, and getting elements.