Merge Sort: Divide-and-ConquerIntroduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.
Recursive Sorting: Merge SortCovers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.
Hashing & SortingExplores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.
Sous-algorithmesIntroduces sub-algorithms and the insertion sort algorithm with a focus on pre-sorted elements.
