Emerge-Sort: Swarm Intelligence Sorting

Dimitris Kalles^{1, 2}, Vassiliki Mperoukli¹, and Andreas Papandreadis²

¹Hellenic Open University, Patras, Greece
[email protected]
[email protected]

²Open University of Cyprus, Nicosia, Cyprus
[email protected]
[email protected]

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²).

LNAI 7297, p. 98 ff.

Full article in PDF | BibTeX

[email protected]
© Springer-Verlag Berlin Heidelberg 2012