Sorting Algorithms Questions
The average-case time complexity of merge sort is O(n log n), where n represents the number of elements being sorted.