Lectures related to Sorting Algorithms: Bubble and Insertion Sort

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

Covers the syntax, differences, constructors, operations, patterns, sorting, and complexity of lists in functional programming.

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

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

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.