how does it takes nk time for merging of one part and then
a total of nklogk
The time complexity using merge sort
@aslesha.j7
There are total of nk elements.
to build the sorted element you get the minimum of all the k list probably using min heap. so that is log k.
So overall complexity nk*logk
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.