Real-time Sorting of Binary Numbers on One-dimensional CA

Thomas Worsch (1) , Hidenosuke Nishio (2)

1 KIT - Karlsruhe Institute of Technology
2 Kyoto University

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.

Mots clés: cellular automata; sort algorithm

Domaines: Autre [cs.OH]

Thomas Worsch, Hidenosuke Nishio. Real-time Sorting of Binary Numbers on One-dimensional CA. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.214-225. ⟨hal-00541906⟩