Lectures related to Divide-and-Conquer: Merge Sort

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Covers the concept of Merge Sort, a highly efficient recursive sorting algorithm.

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

Explains recursion in algorithms and the Karatsuba multiplication method for large numbers.