Question discussion

What is the average case time complexity of merge sort?

Correct answer: A

Explanation

Merge sort takes O(n log n) in the best, average and worst case.

Nobody has replied yet. Start the discussion!