Question

You are given a sorted array x = (x1, x2, , xn) such that each xi is labeled li , where li {1, 2, , m} for m = o(log n). (a) propose a o(log n) crew pram algorithm to determine for each 1 i m, the minimum element of x with label li . Your algorithm must use o(n) operations and should not use any sorting algorithms. [hint: you may try to create auxillary arrays - one for each label] (b) if m = o(log log n), can we do better in the crew pram model? What if the model were crcw pram

Answer 1

where li {1, 2, , m} for m = o(log n). (a) propose a o(log n) crew pram algorithm to determine for each 1 i m, the minimum element of x with label li . Your algorithm must use o(n) operations and should not use any sorting algorithms. [hint: you may try to create auxillary arrays - one for each label] (b) if m = o(log log n).