The time complexity of Merge Sort is 0(nlogn). Merge sort is based on the divide and conquer approach.
