Lectures related to Recursive Sorting Algorithms

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

Covers the basic sorting algorithms, Bubble Sort and Insertion Sort, and hints at more efficient ones.

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

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

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