Question: Suppose you are given a new hardware device that can merge k > 2 different sorted lists of total size n into a single sorted
Suppose you are given a new hardware device that can merge k > 2 different sorted lists of total size n into a single sorted list in O(n) time, independent of the value of k. Such a device could, for example, be based on a hardware streaming system or could be based on a network protocol. Show that you can use this device to sort n elements in O(n log n / log k) time. That is, if k is Θ(√n), then you can use this device to sort in linear time.
Step by Step Solution
3.43 Rating (159 Votes )
There are 3 Steps involved in it
Algorithm Input ksorted lists A1 A2 Ak where Ai has size ni Let L be a matrix of size k x m Here Li ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
2036_61d6ac3425e8a_835329.pdf
180 KBs PDF File
2036_61d6ac3425e8a_835329.docx
120 KBs Word File
