Learn More
This paper studies the bitonic merge sort algorithm which is difficult to get the prospective sorted result for some odd sequence. We develop a new parallel sorting algorithm, increasing CCI (compare and conditionally interchange) operations, derived from the odd merge sort algorithm. The proposed algorithm is based on a divide-and-conquer strategy. First(More)
  • 1