A two step sorting algorithm

A parallel algorithm based on neural networks for solving sorting problems is presented. The proposed algorithm uses
O
(
n

²
) processing elements called binary neurons, where
n
is the number of unsorted elements. It requires two and only two iteration steps, while the conventional parallel sorting algorithm using (
On
) processors proposed by F.T. Leighton (1984) requires the computation time
O
(log
n
). A set of simulation results substantiates the proposed algorithm. The hardware system based on the proposed parallel algorithm is also presented