Question: Which sorting algorithm uses a divide-and-conquer approach and has an average-case time complexity of O(n log n)? - AMAZONAWS
Article Title:
The Best O(n log n) Sorting Algorithm Using Divide-and-Conquer: Merge Sort Explained
Mar 11, 2026