An Approach to a Like-stack Sorting Machine

Suppose log（n）processing units can operate synchronously in an intelli- gent processor（sorting machine）which is adopted at the ports of a memory,an intel- ligent memory with the function of sorting is constructed,which can do sorting in O（n） time.Three algorithms depending on the trade-off of the hardware cost and the sorting speed are given.Where the highest cost algorithm can sort N data in 3（N+1） time,the lower is in 5 N+3「N/(2^k-1)」+2^k-1,and the lowest is in 「3lg^k-1N^1/2-3」*(3 N+ 2^k-1)+5 N+4「N/(2^k-1)」. The three algorithms above are described in this paper.