Lectures related to Merge Sort: Divide and Conquer

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.