PA of Algorithms Q82

82Suppose there are log n sorted lists of n/log n elements each. The time complexity of producing a sorted list of all these elements is:
(Hint: Use a heap data structure)

Option : A
Explanation :
x = n/logn
y = logn
we get O(n/logn * logn * log logn)
So O (n log logn)

Forgot your password?

I agree with the Terms.