Reference

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
   Introduction to Algorithms, 4th Edition, MIT Press, 2022.
   – Chapter 4: Divide-and-Conquer; Chapter 7: Quicksort

2. Robert Sedgewick, Kevin Wayne
   Algorithms, 4th Edition, Addison-Wesley, 2011.
   – Chapter 2: Sorting (Mergesort and Quicksort)

3. Jon Kleinberg, Éva Tardos
   Algorithm Design, Pearson, 2006.
   – Chapter 5: Divide and Conquer

4. NPTEL – Data Structures and Algorithms
   https://nptel.ac.in/courses/106102064
   – Covers sorting algorithms including Merge Sort and Quick Sort.

5. NPTEL – Merge Sort Module
   https://archive.nptel.ac.in/content/storage2/courses/106103069/Module_5/merge_sort1.htm
   – Detailed explanation of Merge Sort and divide-and-conquer approach.