Akriti sood
asked
Dec 27, 2016
388
views
in an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k > 2. This means that you have to merge k lists. How many ... O(n log(k)) time. O(log2 k) O(n) O(logkn) O(lognk)