Sorting Algorithms.
Case: O(n log n) — Same as the best case. Average Case: O(n log n) — Regardless of the initial order of elements. Space Complexity: Merge sort typically requires additional space for the merging process, making it a stable but not in-place sorting algorithm. Use Cases and Limitations Use Cases: