Merge Sort uses a divide-and-conquer approach, splitting the array into halves recursively until single elements remain, then merging them back in sorted order.
Divides array into halves recursively
Merges sorted subarrays efficiently
Stable sorting preserves element order
Requires auxiliary space for merging
Ideal for linked lists and external sorting scenarios