Concept
Corecursion
Related lectures (30)
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.
Von Neumann Extractor: Optimal Binary Extraction Procedure
Covers the von Neumann Extractor, rate computation, and extraction rates.
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.
Tail Recursion
Covers tail recursion, optimizing functions in Scala for iterative processes and providing examples like tail-recursive factorial.
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.
Fractal Dimension: Understanding Complex Geometric Structures
Explores fractal dimension, calculating values analytically and providing practical examples in computer graphics.