Time Complexity
The merging of all the sub-arrays into a single array will take O(N) time, while the array of size N can be divided into logN parts, hence the worst case of merge sort is O(N log N).
Mark As Completed Discussion
Back to course sections
