Please explain briefly

#1

TIME COMPLEXITY OF merge k sorted array??/

#2

hello @AMIT_KUMAR,
if size of each array is n and there are k such array then merging time complexity will be.
O(nklog(k) ) …

#3

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.