Hi!
Assume we have an array of length N where the subarrays from 0 to N/2 and N/2 to N elements are sorted. Is it possible to sort the whole array using constant memory in O(N) time?
Example of an array:
10, 20, 30, 40, 1, 2, 35, 60
Hi!
Assume we have an array of length N where the subarrays from 0 to N/2 and N/2 to N elements are sorted. Is it possible to sort the whole array using constant memory in O(N) time?
Example of an array:
10, 20, 30, 40, 1, 2, 35, 60