(Solved) : Array 0 1 N 1 Numbers Integers Floating Point Sorted N Length Array Array Already Partial Q28127221 . . . .

You have an array A[0], A[1], …, A[n-1] of numbers (integersor floating point) to be sorted, where n is the length of thearray. The array has already been partially pre-sorted in thefollowing way: every t consecutive elements are already sorted,i.e., the following subarrays are sorted:

(A[0], A[1], …, A[t-1])

(A[t], A[t+1], …, A[2t-1])

(A[2t], A[2t+1],…, A[3t-1])

etc

The following is an example of array of values assuming t =4:

3, 7, 13, 15,      0, 4, 9,11,      5, 6, 10,14,      1, 2, 8, 12

Assume that t divides n; and that t is known, i.e., it’s aninput parameter. Also assume that t may grow with n, e.g., t