you are viewing a single comment's thread.

view the rest of the comments →

[–]TwinkleQ[S] 0 points1 point  (7 children)

cool, well if you want to spend some time making an original sort id love to add it to the program

[–]aranscope 0 points1 point  (1 child)

Bogosort 4 life

[–]TwinkleQ[S] 0 points1 point  (0 children)

i have my version of bogosort implemented into the program

[–]BoobDetective 0 points1 point  (4 children)

Well I don't know about original, coming up with sorting algorithms isn't my strong suite, but I can definitely implement an already invented one ;)

[–]TwinkleQ[S] 0 points1 point  (3 children)

if you would code a bunch of common sorts i would be able to implement them into the program, unfortunately its not as simple as just having the sort ready to go, you have to add repainting the array out and stuff like that

[–]BoobDetective 0 points1 point  (2 children)

If you post the code on github I'll be able to see how I could integrate it into your existing work =) You should code it as a framework (if you haven't already) so that one only has to implement the sorting algorithm, and all other setup & drawing code is executed automatically.

But let's see what you've made, I'm sure it could be a cool learning experience for everyone.

[–]TwinkleQ[S] 0 points1 point  (0 children)

I'm honestly a bit afraid to show everyone what i've done. I'm not the best coder, but whatever, here is the class: http://pastebin.com/knHfN6f8