Anonymous user
User talk:MichaelChrisco: Difference between revisions
(new?) sorting algorithm implamentation!!!!! I got it to work!!!! Bead sort!
(→Welcome!: new section) |
((new?) sorting algorithm implamentation!!!!! I got it to work!!!! Bead sort!) |
||
Line 2:
:ya no kidding. Your welcome.
Ive been working on an elegant solution to a paper I found on the internet. Its called Bead-sort http://en.wikipedia.org/wiki/Bead_sort. I am not sure that this is an original idea but I seem to have implemented it in C++. Why C++.....because I couldn't do it in Newlisp (yet!). I think that the elegance of this algorithm is cool (as it was an A HA!! moment for me). It uses a distribution algorithm to distribute the "beads" one at a time though "buckets". These buckets, in turn, are the accumulators (or the after affects of gravity on bead sort).
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.
The following code is open source. Do what you want with it.
| |||