This is a sorting algorithm demonstration tool. I made this because I wanted to end the year with a fun save. Don't give me that look, yes, I find this incredibly fun! :P My absolute favourite is Heapsort, despite the fact that it's not a stable sort.
computer
subframe
sorting
algorithm
r216k2a
z2tags
z1more
z0no
z4everyone
z3thanks
Comments
-
Nope. It takes the computer 3 frames to manage the display every time a swap is done. Depending on how swappy the algorithm being run is, it slows the overall sorting down a little, but generally speaking the sorting is slow because the computer is slow :P But no, the computer doesn't wait for the display to report back or anything. The (one-way) communication between them takes place in a single frame.
-
fantastic work, like always. i have a question, it looks like the cool display operates on an 8 frame cycle, does this slow down the sorting at all?
-
Bubblesort will always be the best - although I love the sheer ridiculousness of spaghetti sort
-
And a great save.
-
LBPHacker: Or you can just double click on username instead of typing it out :P +1 for save description.
-
@Someone_bad_at_tpt: (I respect names so I always type them out fully but man that's a long one) Once you have a computer, implementing sorting algorithms is a breeze :D As for the computer, the keyword is subframe and a bit of applied computer science.
-
@janek123: By clicking. Not always the left button, sometimes the right and the middle one too.
-
@NoVIcE: That's my favourite comment this year.
-
@Java2525: Glad to hear that! Unfortunately there have been a few whom it didn't impress.
-
@Matera_the_Mad: *silent glee*