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:
“Is suffering so very serious? I have come to doubt it. It may be quite childish, a sort of undignified pastime—I’m referring to the kind of suffering a man inflicts on a woman or a woman on a man. It’s extremely painful. I agree that it’s hardly bearable. But I very much fear that this sort of pain deserves no consideration at all. It’s no more worthy of respect than old age or illness.”
—Colette [Sidonie Gabrielle Colette] (1873–1954)