Abstract
A formula is given to merge 2 subfiles of size n/2 each, keep within the left and also the right halves of a linearly connected processor array, in 3n /2 route steps and log n compare-exchange
steps. This formula is extended to merge 2 horizontally adjacent subfiles of size m X n/2 every, keep in associate m X n mesh-connected processor array in row-major order, in m + 2n route steps and log mn compare-exchange steps. These algorithms ar quicker than their counterparts planned thus far. Next, associate formula is given to merge 2 vertically aligned subfiles, keep in a very mesh-connected processor array in row-major order. Finally, a sorting theme is planned that needs eleven n route steps and a pair of log2 n compare-exchange steps to type n2 parts keep
in associate n X n mesh-connected processor array. The previous best sorting algorithm needs fourteen n route steps for sensible values of n, 4 < n < 512 (i.e., mesh-connected processor arrays containing sixteen to 262 a hundre