Lectures related to Heaps and Heapsort

Solving Parity Games in Practice

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

Quick Sort Analysis: Finding k Smallest

Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.

Matrix Multiplication: Strassen's Algorithm

Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.