Divide-and-conquer. Splits the array in half recursively, then merges sorted halves back together. Always O(n log n) — fast and predictable.
