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:
“The nearest the modern general or admiral comes to a small-arms encounter of any sort is at a duck hunt in the company of corporation executives at the retreat of Continental Motors, Inc.”
—C. Wright Mills (1916–1962)