Time Complexity of Merge Sort
T(n) = 2T(n/2) + n [ This n is the time to divide the whole array into two parts. As we have to traverse the whole array that's why the Time will be depending on the length of the array i.e. n] If you have any further queries let me know in the comment section ?
T(n) = 2T(n/2) + n [ This n is the time to divide the whole array into two parts. As we have to traverse the whole array that's why the Time will be depending on the length of the array i.e. n] If you have any further queries let me know in the comment section ?