Merge Sort
Merge Sort is a popular and efficient sorting algorithm that follows the divide and conquer paradigm. It works by recursively dividing the array into two halves, sorting each half, and then merging the sorted halves back together. The merging process ensures that the final array is sorted.
Steps:
Divide the unsorted array into two halves.
Conquer by recursively sorting the two halves.
Combine the two sorted halves by merging them to produce a sorted array.