Lectures related to Analysis of algorithms

Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.

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

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