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:
“They are very proper forest houses, the stems of the trees collected together and piled up around a man to keep out wind and rain,—made of living green logs, hanging with moss and lichen, and with the curls and fringes of the yellow birch bark, and dripping with resin, fresh and moist, and redolent of swampy odors, with that sort of vigor and perennialness even about them that toadstools suggest.”
—Henry David Thoreau (1817–1862)