Which sorting algorithm uses a divide-and-conquer strategy to sort data?

Merge Sort is a sorting algorithm that uses a divide-and-conquer strategy. It divides the unsorted list into smaller sublists, sorts those sublists, and then merges them to obtain the final sorted list. This approach results in better performance compared to some other sorting algorithms.