Question: Space aliens have given us a method, alienSplit, that can take a sequence S of n integers and partition S in O(n) time into sequences
Space aliens have given us a method, alienSplit, that can take a sequence S of n integers and partition S in O(n) time into sequences S1,S2, . . . ,Sk of size at most ⌈n/k⌉ each, such that the elements in Si are less than or equal to every element in Si+1, for i = 1,2, . . . ,k−1, for a fixed number, k < n. Show how to use alienSplit to sort S in O(nlogn/logk) time.
Step by Step Solution
3.55 Rating (162 Votes )
There are 3 Steps involved in it
Alien split is a function that splits a given array into k parts so th... View full answer
Get step-by-step solutions from verified subject matter experts
