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

Sat, 18 Apr 2026 09:33:52 +0000

Article Title:
The Best O(n log n) Sorting Algorithm Using Divide-and-Conquer: Merge Sort Explained Meta Description:
Discover how Merge Sort employs a divide-and-conquer strategy and consistently delivers O(n log n) performance on average—making it one of the most reliable sorting algorithms in computer science. --- ## Which Sorting Algorithm Uses Divide-and-Conquer with O(n log n) Average Case Time Complexity?