Real-Time Sorting of Binary Numbers on One-Dimensional CA

A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This is only one step more than a lower bound.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Thomas Worsch, Hidenosuke Nishio
• Keywords: Binary Numbers, CORR 2010, Education, Nk Steps, One-dimensional Cellular Automata