Abstract
We examine sorting on the assumption we do not know in advance which way to sort. We use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences. These are the basic elements of Emerge-Sort, an approach to self-organizing sorting, which we experimentally validate and observe a run-time behavior of O(n 2). © 2012 Springer-Verlag.
Cite
CITATION STYLE
Kalles, D., Mperoukli, V., & Papandreadis, A. (2012). Emerge-sort: Swarm intelligence sorting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7297 LNCS, pp. 98–105). https://doi.org/10.1007/978-3-642-30448-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
