Lectures related to Merge Sort: Divide and Conquer

Explores decision tree analysis for sorting algorithms and introduces the Counting Sort efficiency based on input structure.

Explores derivatives, O-Notation, extrema, and algorithm complexity in Analysis 1.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

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