Comments on Integer Sorting on Sum-CRCW

Given an arrayX of n elements from a restricted domain of integers[1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments on the algorithm. The first comment is the algorithm not runs in sublogarithmic… CONTINUE READING