Lectures related to Sorting Algorithms: Merge Sort

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

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

Explores recursive sorting algorithms, recursion, dynamic programming, and the efficiency of recursive solutions.

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