Anonymous user
User talk:MichaelChrisco: Difference between revisions
→Bead sort: a Unique Solution
m (O(2n) complexity not O(n) in this case) |
|||
Line 7:
I was trying to figure out a solution into turning them back into a list/array sorted format when it hit me! Use the same algorithm twice! So i did. And it worked! It works because gravity works both ways.
[[File:MAC_Bead_Sort.jpg|400px|thumb|center|Bead Sort visualized]]
The following code is open source. Do what you want with it (just gimme a little credit and the original authors of the paper):
| |||