Slow Sort

Visualization and "audibilization" of the Slow Sort algorithm.

[tiltedtesseract]

slow sort is just merge sort with the severe paranoia that the elements have moved themselves while it wasn't looking.

[scitechian]

Fun fact: This algorithm was created to be the least efficient way possible to sort an array without deliberately making things any worse. The implementation was proposed as a counter to the "divide and conquer" strategy that Mergesort works on, and the author called it "multiply and surrender". It was the subject of his Master's Thesis.

[Cerealbox]

You know you've been programming too long when you find a sorting algorithm to be hilarious.

[RomanSoldier]

From the Wikipedia article: "Even the best case is worse than bubblesort" AHAHAHAHAHAA

[arthurhill]

I strongly empathize with this algorithm.

[icypengin]

This is how I check my answers on an important test.

[northrupthebandgeek]

Sounds like some kind of experimental jazz. I love it.

[GibusWearingMann]

You could probably sort it faster by hand.

[moth.monster]

It appears to tickle the integers before moving them.

[noahlovotti]

I tried to mimic the temperment of this, and got what roughly translates to 22 tones per 1.5 octave. The fact that an algorithm with random numbers can generate full fledged microtonal music is insane.

[KnakuanaRka]

In case you’re wondering, this is what’s happening:
Split the array in half.
Sort each half with slowsort (recursively).
Compare the highest element from each half.
Move the bigger one to the end of the list.
Repeat from the top, omitting the last element (the one moved into position) from the sorting.

Basically, a demented combination of merge and insertion sort.

Edit: Merge and SELECTION sort, my bad.

[sonicmastersword]

At least it can finish, bogo sort would likely take a 1000 years.

[zazz_il_]

youtube put this in my music playlist...

[noticeme]

love how slow sort was deliberately programmed to sort as inefficiently as possible without including random elements as a joke.

[josephharold]

I'm a beginner in computer science and I couldn't even think of how I would go about programming something like this. Something this inefficient can not be accidentally programmed. This is awe inspiring.

[虞石]

There is certainly some musical property in this:D

[ferociousfeind]

"There appears to be no signs of intelligent life anywhere."

[Sad-Lemon]

Damn need to watch this again, couldn't grasp a shit twas that quick.

[Springwight]

Fun fact - the benefit of this algorithm over bogosort is that while bogosort has O(n!) time complexity in the worst case, it still has O(n) time complexity in the best case! The best case complexity of slowsort on the other hand is w(x^n) for any n. If that's not an achievement, I don't know what is.

[hanss]

This one sounds the best out of all of the sorting algorithms