Comprehensive C++ implementation and performance analysis of 12 sorting algorithms: Merge Sort, Heap Sort, Quick Sort,
Intro Sort, Tim Sort, Bubble Sort, Insertion Sort, Selection Sort, Cocktail Shaker Sort, Comb Sort, Library Sort, and Tournament Sort.
Evaluated using datasets of sizes n (1K to 1M) across five distributions: Random, Dense Random (high-frequency duplicates), Ascending, Descending, and Partially Sorted.