Lectures related to Complexity & Induction: Algorithms & Proofs

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Introduces Cartesian product and induction for proofs using integers and sets.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

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

Explores the binary search algorithm's efficiency in reducing search time.