In Place Merge Sort

In Place Merge Sort is a variant of Merge Sort that merges sorted subarrays without requiring additional memory, achieving O(1) extra space at the cost of more complex element shifting.