Lectures related to Merge sort

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Introduces Matlab basics, error handling, and billiards project concepts.

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

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

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