A neural sorting network with O(1) time complexity
Wen-Tsuen Chen Wen-Tsuen Chen, Kuen-Rong Hsieh · 1990
A multilayer feedforward neural network is proposed to solve sorting problems. The network has O(n2) neurons and O(n2) links. The number of layers is fixed regardless of input size. Thus, the computation time of the network is independent of input size, and the sorting network has a time complexity of O(1)