*Answer: c) Merge Sort* Merge Sort always divides the array into halves and merges them in a sorted manner, leading to a consistent O(n log n) time complexity in best, average, and worst cases. *React with ❤️ if you got it right!*