How we have decided the constant K and K(n) in time complexity?
Space and Time Complexity of merge sort
Finding the mid point is a single operation. But we have to find it for every subarray. So we take it is a linear operation and we take it as any random number k.
Merging the 2 parts is also a linear operation and we have to merge parts of different sizes in each step. So we take it to be kn in worst case.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.