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
-
@LBPHakcer, My issue with this is that I do not see a visual change in the save before pressing any number on your keyboard (1-7) as instructed by its monitor after having done so, other than the text being removed from the screen...
-
@NoVIcE, I know... Only troglodytes don't know how to follow those instructions. lol
-
In-place merge sort is a pain in the bum to implement, and honestly to even watch; and non-in-place algorithms are pretty difficult to demonstrate effectively with this this tool. So I opted to leave it out, as much fun as merge sort is.
-
What about merge sort?
-
@R33sesK1ng click on "Click Me" text, then read what it writes on the screen and choose an option.
-
I can't replicate that issue. Pressing the button starts the program for me.
-
After I press a button, nothing seems to happen. Is there even a reason for the panel of 1-35 there?
-
Update: I added a sorting algorithm named "Ugly Hacks" that exploits the fact that the values in the dataset match their final position after sorting. This is a very special property of this dataset and never happens in practice. Note that this makes it the fastest sorting algorithm of them all. I think its name is fitting. Remember, comparison sorting isn't always the answer.
-
i wonder, i have an unused brain, +1
-
Dang... that's cool +42