Sorting Algorithms.
sorted subarrays are combined to produce the final sorted array. Time and Space Complexity Analysis Time Complexity: Best Case: O(n log n) — When the pivot is chosen consistently divides the array in a balanced manner. Worst Case: O(n²) — Occurs when the pivot selection leads to highly unbalanced