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 mor
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.
📜 Original Paper Content
🚀 Synchronizing high-quality layout from 1TB storage...