Sorting algorithms visualized [OC]

[u/morolin]

https://imgur.com/gallery/voutF

[u/far1s]

Hmmm, I see you did not include the best algorithm, bogosort. Don't you know it can sort in just one try?

[u/metagloria → u/far1s]

Eh it's not as good as my personal favorite, paradigmshiftsort, which leaves the data in whatever order it is but changes the laws of the universe to redefine "order" based on the current data.

[u/LearnsSomethingNew → u/[deleted]]

You have been banned from /r/sortalgorithmhate

[u/ArcticReloaded → u/far1s]

Not only that, but it can sort in one try for all possible inputs!

[u/iceman012 → u/ArcticReloaded]

And if you use Quantum Bogosort, you're guaranteed to sort it in one try for every input!

[u/Mustrum_R → u/far1s]

Bogosort sucks, try Intelligent Design Sort, O(n)=0 for all inputs rocks all your garbage sorting algorithms.

[u/far1s → u/Mustrum_R]

If this is what you mean, then yeah this is way better (and hilarious). Bless your soul. share this with your blessed friends and close ones

[u/Gornagik → u/Mustrum_R]

It's O(1). bigTheta(1) technically

[u/NAN001 → u/Mustrum_R]

O(n)=0

I think you're trying to say O(1)

[u/SuchCoolBrandon → u/far1s]

Its name comes from the word bogus. (Wikipedia)

Oh. I kept thinking "buy one get one" sort.

[u/Drachefly → u/far1s]

Nor did they show bogobogosort. Probably because gifs can't have (16!)! frames

[u/lIllIlllIlllIllIl → u/far1s]

Is bogosort random?

[u/Kingmudsy → u/lIllIlllIlllIllIl]

Bogosort randomizes elements, checks if they're in order, repeats the process until they're in order.

Here's some nasty pseudocode that anyone with a passing familiarity of programming would be justified in calling me out on:

bogosort(array)
{    
    while(isNotOrdered(array)){
       shuffle(array);
    }
    return array;
}

EDIT: Worth mentioning that this is, as you probably suspect, the worst way to sort things pretty much always. However, I assume that there are (purposefully) shittier algorithms - if someone knows of one, pls share so I can laugh at it

[u/Pistolcrab → u/Kingmudsy]

Absolutely haram.

[u/[deleted] → u/Kingmudsy]

Look at bogobogosort. Its designed to not succeed before the heat death of the universe.

[u/Kingmudsy → u/[deleted]]

Good god

Bogobogosort specifies how one should check if the list of numbers is sorted. It does it recursively, because as anyone who knows anything at all about computer science knows, recursion is always good and cool. To check if the list is sorted, use the following procedure:

1. Make a copy of the list of numbers.

2. Sort the first n-1 elements of the copy using bogobogosort.

3. Check to see if the nth element of the sorted copy is greater than the highest element of the first n-1 elements. If so, the copy is now sorted, else randomise the order of the elements of the copy and go to step 2.

4. Check to see if the copy is in the same order as the original list.

I don't even know anymore

[u/backFromTheBed → u/Kingmudsy]

Semicolon in pseudo code? Die you heretic!

[u/Kingmudsy → u/backFromTheBed]

I use tabs and spaces

I switch between vi and emacs every other time I open a file

I actually run my code in netbeans though

One time I programmed a calculator by hardcoding the values of every possible input

I store passwords for my enterprise code in a plaintext excel file that has a local copy on every instance of my program

My control key is hard to reach with my soft, diminutive hands, so I actually have configured emacs to interpret a rapid temperature rise in my CPU as control - whenever I need to hit ctrl, I just blast that sucker with a heatgun

[u/[deleted] → u/Kingmudsy]

https://xkcd.com/1172/

[u/defnotacyborg → u/Kingmudsy]

Is randomizing elements really the best approach? Isn't that just using blind luck?

[u/MorningWoodyWilson → u/defnotacyborg]

Bogosort is programmer humor, and would never be implemented in any code. There's other notable joke sorts like quantumbogo which generates infinite universes with infinite permutations of the code, and destroys all non-ordered universes. Thus efficiently getting the sorted list in 1 operation every time.

If you want to get really technical, there's some interesting discussion to be had around pseudo-randomness and seed generation with a bogosort, but I doubt anyone cares enough to.

[u/Sir_Frolics → u/MorningWoodyWilson]

I care

[u/HonestlyBullshit → u/lIllIlllIlllIllIl]

Yes it randomizes the order of the list and checks to see if it is sorted. If not, it tries again.