Question: Which sorting algorithm uses a divide-and-conquer approach and has an average-case time complexity of O(n log n)?