Lectures related to Quicksort: Expected Running Time and Decision Tree

Analyzes the running time and comparisons in randomized quick sort, proving its efficiency and optimality in comparison sorting.

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

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.