Sorting with one-dimensional cellular automata using odd-even transposition
Tipo
Artigo de evento
Data de publicação
2015
Periódico
Advances in Intelligent Systems and Computing
Citações (Scopus)
0
Autores
de Carvalho C.E.
de Oliveira P.P.
de Oliveira P.P.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
© Springer International Publishing Switzerland 2015.Cellular automata are both discrete complex and fully distributed computational systems, with arbitrarily simple local processing. One of the computations that can be performed using cellular automata is the sorting of numerical sequences. Sorting is a relevant topic and occurs widely as a fundamental computing problem. This paper presents the development of improved sorting algorithms based upon one-dimensional cellular automata. Two new versions with radii of 1 and 3 are proposed, inspired by the characteristics of the existing methods. These algorithms are presented and their advantages and performance with respect to the existing approaches are discussed.
Descrição
Palavras-chave
Assuntos Scopus
532 , Computational system , Discrete complexes , Local processing , Numerical sequence , Sorting algorithm