WorldCIST'15 - 3rd World Conference on Information Systems and Technologies

Full Program »

Sorting with one-dimensional cellular automata by odd-even transposition

Cellular automata are discrete complex systems and fully distributed computational systems, with arbitrarily simple local processing. One of computations that can be made with cellular automata is sorting of numerical sequences. Sorting is quite relevant topic and widely used in computing, as one of its fundamental problems. Here we develop sorting algorithms based upon one-dimensional cellular automata. Two new versions with radius 1 and 3 have been proposed, inspired by the characteristics of existing studies in the literature. These algorithms are presented and their advantages, in respect to the approaches that originated them, are discussed.

Author(s):

Carlos Eduardo Profeta de Carvalho    
Universidade Presbiteriana Mackenzie
Brazil

Pedro Paulo Balbi de Oliveira    
Universidade Presbiteriana Mackenzie
Brazil

 

Powered by OpenConf®
Copyright ©2002-2013 Zakon Group LLC