User talk:MichaelChrisco: Difference between revisions

m
Bead sort: positive, zero and negative (small edits and perhaps a bit of work to be done)
No edit summary
m (Bead sort: positive, zero and negative (small edits and perhaps a bit of work to be done))
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)