pace complexity of Merge sort code example
Example: time complexity of merge sort
O(n*Log n):
The time complexity of MergeSort is O(n*Log n) in all the 3 cases
(worst, average and best).
As the mergesort always divides the array into two halves
and takes linear time to merge two halves.