A divide-and-conquer algorithm that divides the array into halves, recursively sorts them, and then merges the sorted halves.
Merge sort is an efficient, stable, divide-and-conquer sorting algorithm that works by recursively dividing the array into two halves, sorting each half, and then merging the sorted halves back together. It guarantees O(n log n) time complexity in all cases, making it one of the most reliable sorting algorithms for large datasets.