I’m working on a homework assignment and as a ‘hint’ we are told to find the following algorithm, and then prove it to the necessary answer.
Let L(1), L(2), .., L(k) be sorted lists of n elements each. Give a O(kn logk) space algorithm that supports the O(log n + t) Locate operation, which returns the location of t items.
Ideally, I will be able to use this algorithm to give me some insight into achieving a better solution (which is what the assignment wants), but this less effecient algorithm is supposed to inspire me, but I can’t figure it out. Any thoughts or know what this algorithm is? Thanks!
Have you googled for O(kn logk) ? That seems to be a pretty unique big-O signature.
Here’s my first result: MergeSort –> What is the relation between merges and number of items in a in k-way merge