Question

What is the time complexity for executing merge sort on the array size n is already sorted is?

Answer 1

O(nlogn) is the time complexity for executing merge sort on an array of size n which is already sorted.