Quad Merge Sort

Quad Merge Sort is a divide-and-conquer sorting algorithm that recursively splits the array into four parts, sorts them individually, and merges them efficiently.