Lectures related to Sorting Algorithms: Bubble and Insertion Sort

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.

Covers the analysis of algorithms, focusing on insertion sort and computational models.

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

Covers the implementation of a parallel merge sort algorithm in Scala, comparing its performance with quicksort.