Lectures related to Insertion Sort: Basics and Analysis

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

Explores the efficiency and complexity of the selection sort algorithm compared to other sorting methods.

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

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

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