Bead sort is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in 2002, and published in The Bulletin of the European Association for Theoretical Computer Science. Both digital and analog hardware implementations of bead sort can achieve a sorting time of O(n); however, the implementation of this algorithm tends to be significantly slower in software and can only be used to sort lists of positive integers. Also, it would seem that even in the best case, the algorithm requires O(n2) space.
Read more about Bead Sort: Algorithm Overview, Complexity
Famous quotes containing the word sort:
“People of substance may sin without being exposed for their stolen pleasure; but servants and the poorer sort of women have seldom an opportunity of concealing a big belly, or at least the consequences of it.”
—Bernard Mandeville (1670–1733)