Lectures related to Divide-and-Conquer: Merge Sort

Introduces the merge sort algorithm through the divide-and-conquer approach, emphasizing correctness and time analysis.

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

Covers the analysis of algorithms, focusing on insertion sort and computational models.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Explores active learning implications in understanding group structures and symmetric actions.

Explores parallel and distributed databases, covering architectures, query optimization, data storage, and distributed transactions.

Explores group actions and equivariant morphisms in group theory.