Anonymous user
User talk:MichaelChrisco: Difference between revisions
m
→Bead sort: An update
No edit summary |
|||
Line 3:
===Bead sort: An update===
In the wikipedia page it states that:
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.
I intend to prove them wrong:
<lang cpp>
Line 30 ⟶ 35:
Sorted list/array -4 -3 -1
===Bead sort: a Unique Solution===
| |||