Anonymous user
User talk:MichaelChrisco: Difference between revisions
→Bead sort: a Unique Solution
No edit summary |
|||
| (One intermediate revision by the same user not shown) | |||
Line 6:
Posted the work here:
http://csinsider.homeip.net/index.php/User_talk:Michaelc
Further work will be to:
*Create a list structure in bead sort and do analysis on performance
*Do a complete performance analysis with other sorting algorithms in different data sets
*I have an Idea how to make this sort even faster but I will have to keep that a secret for now
<lang cpp>
//combination of both positive and negative bead sort (with zeros)
Line 189 ⟶ 194:
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:
| |||