Lectures related to Contextual abstraction: Functional Programming

Introduces sub-algorithms and the insertion sort algorithm with a focus on pre-sorted elements.

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers maps as key-value data structures, including querying, updating, and handling missing values, with practical examples like polynomial representation.

Computation & Algorithms II: Binary Search and Merge Sort

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