artzi@cpsvax.cps.msu.edu (Ytshak Artzi - CPS) (04/11/89)
Please comment on the following NAIVE algorithm:
Let n1, n2,....nk be neurons in a network
For every 2 connected neurons (Ni,Nj) we define Ni to "LEFT"
and Nj to be "RIGHT"
The neurons are initially assigned numeric values (numbers we wish
to sort)
We activate the network;
We let the neurons to exchange information among them "freely"
until EVERY "LEFT" contains a smaller value than its "RIGHT"
We defined this stage as SORTED NETWORK
-------------
Questions:
1. Is the computing time predictable ?
2. How can we evaluate the performance of the algorithm (criteria) ?
3. Has anyone done it before ?
4. Does anyone know of a sorting algorithm ?
NOTE: if it makes it easier for you, you may assume any Network model,
with or without feedback, etc.
Thanks.
Itzik Artzi, CPS, Michigan State University
artzi@cpsvax.cps.msu.edu