Merge Sort, Merge Sort Algorithm, Data Structures, Data Structure Algorithm, Naem Azam.
O(nlogn). In every other case, we have to apply the technique of divide and conquer and hence we can conclude the time complexity of merge sort as follows: Best Time Complexity: O(nlogn) Average Time Complexity: O(nlogn) Worst Time Complexity: O(nlogn) Space Complexity For the application of Merge