The WORST Algorithms EVER created👩‍💻 #tech #developer #coder #software #technology #javascript

[falarikae]

"This is actually the algorithm that the Reddit search uses" checks out

[horbinrodas]

FACT: 90% of bogo sorts quit right before they're about to get it right

[AkivaB]

stalin sort being the only O(n) sort is hilarious

[thomaswillems]

You missed one:
Orwell sort: take an unordered list, declare that it is ordered and arrest anyone that says otherwise.
It’s the fastest sorting algorithm, running in O(1984) time

[modGSpirit]

The solar sort is the best. Waiting for solar charges to change the values until the list is sorted.

[danieldev]

Technically there exists a universe where Bogo Sort is the most efficient sort algorithm ever

[SahilP]

I am still waiting for my miracle sort to finish. Any day now... it will complete... any day... now....

[noredine]

You forgot about Sleep Sort
You create a thread for each element "i", sleep for "i" ms, and add the element to result array after the sleep ends
(may take until the heat death of the universe for big numbers)

[DepressedNOF]

Miracle sort could actually work better when the memory is exposed to high energy solar radiation.

[ElectroMutex]

Last one is actually good based on Qubits

[pickle]

Bogo sort is useless but if the sort works, it will be for that occurence the fastest algorithm in the world

[kaiperdaens]

Bogo sort is actually also the most efficient sorting algorithm.

[lloyd]

Don't ever doubt Bogo Sort.
One time, it could be O(1). Other times, it could be O(∞)

[ottelf]

I love this. I don't code or anything, but have some really small knowledge on...? Idek, but it's really nice to watch these, and it takes me a while to realize if they're jokes or real stuff people use.

[xddcce]

The Stalin one had me rolling on the floor💀

[idk-cs]

Miracle Sort bout to confuse the Speedrunning community

[zildeos]

You forgot sleep sort, where you spawn a bunch of threads, sleep for the value and push it to the stack. Works every time.

[kamathln]

Time travel algorithm. Initiate sorting through any normal method. Time travel to the future and bring back the result.

[Kahadi]

All of these make me think of Homestuck. For those that don't know, it was a web comic with a lot of gaming and coding references and jokes. One of them was that each character had an inventory like in a video game, but using different ways of retrieving things, which they just referred to as a modus, and sorting things like this talks about. Things like FILO, FIFO, Hashmaps, Trees. One of them was actually a Miracle Modus, where the character just got whatever item was given to him and had to hope it was the right one.

The other aspect it reminds me of is that there was a fictional coding language called ~ath (a pun on til death), where it used the death or lifespan of things to call on arguments. Like one was scripted to run when a certain character died. And the most important one was scripted to run when that universe died.

[gavrielshemesh]

There is a universe where bogosort works every time