Lectures related to Sous-algorithmes

Covers the merge sort algorithm, which recursively divides, sorts, and merges sublists to achieve a final sorted list.

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

Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.

Covers the concept of Merge Sort, a highly efficient recursive sorting algorithm.