Lectures related to Merge Sort: Divide-and-Conquer Approach

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

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Covers the implementation of a parallel merge sort algorithm in Scala, comparing its performance with quicksort.