Lectures related to Sorting Algorithms: Merge Sort

Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.

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 binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.