Lectures related to Hashing & Sorting

Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.

Analyzes the running time and comparisons in randomized quick sort, proving its efficiency and optimality in comparison sorting.

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

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

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