MergeSort algorithm given with (n × k) sorted subarrays, where each subarray is having size of \(\frac{{{n^3}}}{k}\), What is the time complexity for finding single sorted array?

1
(n3)log(nk)
2
n log(nk)
3
(n2) log(nk)
4
(n4) log(nk)
5
Question Not Attempted

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation