Page history
User_talk:MichaelChrisco
5 May 2013
28 August 2010
rosettacode>MichaelChrisco
Bead sort: positive, zero and negative (small edits and perhaps a bit of work to be done)
m+280
rosettacode>MichaelChrisco
no edit summary
+3,398
26 August 2010
25 August 2010
66.238.211.130
no edit summary
+11
66.238.211.130
no edit summary
+1,805
rosettacode>MichaelChrisco
→Bead sort: An update
+6
rosettacode>MichaelChrisco
→Bead sort: An update
m+398
rosettacode>MichaelChrisco
no edit summary
+10
rosettacode>MichaelChrisco
Update on Bead sort. Created a negative version of the algorithm
+545
rosettacode>MichaelChrisco
→Sorry for missing you in IRC
+210
24 August 2010
23 August 2010
67.182.50.44
→Sorry for missing you in IRC
+50
rosettacode>MichaelChrisco
→Sorry for missing you in IRC
+53
rosettacode>MichaelChrisco
→Sorry for missing you in IRC
+230
rosettacode>MichaelChrisco
→Sorry for missing you in IRC
m+98
MikeMol
→Sorry for missing you in IRC: new section
+286
22 August 2010
rosettacode>MichaelChrisco
corrections
+6
rosettacode>MichaelChrisco
→Bead sort: a Unique Solution: Based off of paper http://www.cs.auckland.ac.nz/~jaru003/research/publications/journals/beadsort.pdf
+109
rosettacode>MichaelChrisco
→Bead sort: a Unique Solution
+68
rosettacode>MichaelChrisco
O(2n) complexity not O(n) in this case
m+1
rosettacode>MichaelChrisco
newLISP non-working impl. (work in progress)
m+946
rosettacode>MichaelChrisco
no edit summary
+36
rosettacode>MichaelChrisco
no edit summary
m+371
rosettacode>MichaelChrisco
no edit summary
m+67
rosettacode>MichaelChrisco
no edit summary
m+8
rosettacode>MichaelChrisco
no edit summary
−2
rosettacode>MichaelChrisco
no edit summary
+129
rosettacode>MichaelChrisco
Bead sort C++ code
+1,551
rosettacode>MichaelChrisco
(new?) sorting algorithm implamentation!!!!! I got it to work!!!! Bead sort!
+701