A super-parallel sorting algorithm based on neural networks

A novel neural network parallel algorithm for sorting problems is presented. The proposed algorithm using O(n/sup 2/) processors requires only two steps, and does not depend on the size of the problem, while the conventional parallel sorting algorithm using O(n) processors by F.T. Leighton (1984) needs the computation time O(log n/sup 2/). A set of simulation results substantiates the proposed algorithm. The hardware system based on the proposed parallel algorithm is also presented.<
>