User talk:MichaelChrisco: Difference between revisions

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(n22n) space.