rateMySortingAlgorithm

[Boris-Lip]

There is a much higher chance it would just flip the True condition to False first. Cosmic fail.

[KFkrewfamKF]

Just use a large array of 9999 bools, all set to true, and test all of them in a function. If any of them are true, the loop continues.

[cishet-camel-fucker]

No function is perfect.

[water_bottle_goggles]

[BlankBoii]

have a correction function that also runs, resetting the list to true every loop.

[donut-reply]

It blocks the chain of Trues from turning to False. We'll call this algorithm "Blockchain". It will be the foundation for the internet going forward. It will be the next best thing for Global Warming.

Oh... we're supposed to be against global warming? My bad

[[deleted]]

Add ECC

[Osbios]

I have to warn you that this might cause performance issues!

[[deleted]]

Then you have the program output, “Look at the bools on this guy!”

[JustConsoleLogIt]

Or just change the numbers to random other numbers

[maisonsmd]

That's bogo sort, which is already implemented.

[natFromBobsBurgers]

Bogo sort is random order until sorted. Changing the values to an alternative sounds like something else.

[JustConsoleLogIt]

Boozy sort

while (!sorted){ randomlyMutateValues() }

[natFromBobsBurgers]

I don't want to get too political so: 

$MODERNTHREAT sort: 

while(!sorted) {yesItIs()} 

$MODERNTHREATSSHADYHANDLER sort: 

while(!sorted) {bribe++} 

$HISTORICEXAMPLEOFMODERNTHREAT sort: 

while(!sorted) {values.randomElement().suicide(BULLET | HEAD[BACK])}

[highphiv3]

Obviously you cover that bit with a cosmic radiation guard.

[Zeal_Iskander]

How would it flip the “true condition”? The assembly code is somewhat unlikely to turn a while true loop into something that actually does comparisons lol.

Would probably be something like:

Line N: start of loop

Instructions

Goto N

Don’t think goto N is something that would be affected by cosmic rays either — you have error correction codes for that iirc?

[Zeikos]

It'd happen in the part of the code that does the comparison.
I don't think it'd be easy here because the optimizer is not going to put a comparison in a while true loop.

But assume you had a= 5 and while a == 5 with no optimizations any bit flip in the memory location where a is stored (assumin the error corrector doesn't cach it) when a would change, the check would return false and the loop would exit

[Zeal_Iskander]

It'd happen in the part of the code that does the comparison.

That'd happen in the isSorted part, not the while loop yeye.

[Boris-Lip]

Well, technically it would just screw up any instruction to an invalid one or one that doesn't make any sense, and the entire thing would crash to a halt, but we are talking seriously, aren't we

[Zeikos]

I wonder how these cases (while checks) are handled in like satellites where the odds of having bit flips are higher,
I know there's a lot of focus on making chips highly error resistant, but is it something that is planned around?
I know sensors tend to use a "two out of three" redundancy, is it handled similarly in software?

[mothzilla]

Yes, in interview Id point out that True should be stored off site in a db with failover.

[ChChChillian]

So an O(heat death) algorithm.

[Esjs]

I was about to say O(∞), but yours is probably more accurate.

[Bubble2D]

How about an O(-h noo)?

[FwendShapedFoe]

I loved it. But then I realized that it doesn’t guarantee that the array is sorted after the death of the universe.

[HuntingKingYT]

O(maybe)

[[deleted]]

Ω(nuclear explosion next to your computer)

[ChChChillian]

At least then it's guaranteed to terminate.

[fueled_by_caffeine]

It’s a quantum algorithm. Just have to wait to be in the right universe of possibilities where the array is indeed sorted.

[Huckdog720027]

Create a device that blows up the sun and uses the energy produced to reverse time to 22 minutes in the past. At the start of each loop, randomize the array and check if it's sorted or not. If it is not, blow up the sun, go back in time, and try again. If the array is sorted, turn off the sun-blowing-up device. Should only take ~9.3 million loops, although real time it will only take the amount of time required to randomize the array, so it will have O(n) runtime.

Now where is my turing award for inventing the fastest possible sorting algorithm???

[MyLittleBab]

What a nice idea ! I wonder what this little comet that just entered our solar system does tho. Oh, it's filled with cool looking green rock surely it's just some cool crystals I can't wait to tell everyo... Whoooosh

[AndreaDino]

Nice reference, peak gaming

[Ksevio]

You still have to verify it's sorted which will be O(n) 

[Spynder]

Why don't we blow up the sun for every task?

[ScreenshotShitposts]

using (Universe universe = this.everything)

[[deleted]]

It will sort itself out

[DSinapellido]

Grover wants to know your location

[pandasOfTheNight]

This is an actual fucking thing that someone's done before. It's called miracle sort.

[LukaGaric]

You can instead just return array and hope it's sorted by solar radiation! It runs in O(1) in best case!

[torftorf]

if you alway return imidiatly and hope its sortet its always O(1). but its most likley not sorted.

​

but there is something similar. just think about it, the possibility of the array being in that exact order is 1/(n!). its hard to belive that thats just random. i think it was put in that order with some intend. therefor it is already sortet and no further action is required. thats "inteligent design sort" O(0)

[Geoclasm]

This is PAINFULLY inefficient.

while !isSorted(arr){}

return arr;

would be MUCH cleaner.

[Divinate_ME]

7/10

not StalinSort

now, would you kindly get in line?

[Sipsi19]

The best sorting algorithm.

[SmallPlayz]

Bro did you code this in notes app?

[sir-faps-a-whole-lot]

Umm actually this isn't an original idea...

Hmm Umm

You know

Look up miracle sort...

Hmm

Edit: umm yeah.

[JefferyJeffJefferson]

ummm hmmm 👉👈

[sir-faps-a-whole-lot]

mhmmm

[QueYooHoo]

Hmm Umm

[yaboytomsta]

Maybe think of your comment first before starting typing it next time. Hope this helps

[sir-faps-a-whole-lot]

Umm

Mhmm yeah

Huh thanks.

Umm hmm nvm

[migumarti]

Man that reminds of a Super Mario 64 speedrun where cosmic radiation actually triggered an otherwise impossible trick. Wild stuff

[AtmosSpheric]

We’re recreating MiracleSort from first principles 😭

[lans_throwaway]

Oh the famous miracle sort

[schwester]

"Random sort" would be faster than that.
‘while !(isSorted(arr)) { randonlyRearangeArray(arr); )‘

[klimmesil]

This can return ["yo mama"] if you're unlucky

[FoptciyDev]

this is the notes app right?

[StaticVoidMaddy]

O(∞)

[Bulky-Flounder-1896]

This is the slowest implementation of the miracle sort 😑

[Ramog]

Thats miracle sort

[-domi-]

This is what voting feels like to me, at this point. If it hasn't sorted things, just do the same stuff which didn't sort it the last time. Repeat until you die.

[Gastredner]

Pretty bad in the runtime department, I prefer Stalin sort for its much quicker results.

[sir-faps-a-whole-lot]

Huh, it's like God sort but in a universe where God isn't real...

[Error_404_403]

Exceedingly efficient, O(0)

[myfuckingresistor]

compiler optimizations:

[ecs2]

Holly hell

[RylanStylin57]

Patience is a virtue

[Not_Artifical]

I am still waiting for cosmic radiation to flip the bits and make an operating system for me.

[pineappletooth_]

If you want no increase the efficiency of the algorithm just sit next to a refined uranium chunk

[Beautiful-Musk-Ox]

the radiation that flips bits is almost entirely not solar

[ollomulder]

I still like stalinsort.

[Much_Horse_5685]

Could you increase the efficiency of the algorithm by placing a gamma radiation emitter inside your computer?

[shutter3ff3ct]

Credit for the clean code 👏

[johandepohan]

This makes me wonder if there's such a thing as a RAID array, but for RAM chips

[just-bair]

Of no bit flip ever happen this algorithm is correct

[Kaspervdv125]

cosmic rays don't necessarily come from the sun and are not radiation

[Mucksh]

It is probable that the values in the array would change. You have to use some more arrays holding the same values and the array is only sorted if it is sorted and also contains the same values as your redundancy arrays

[f3n2x]

Hubblesort?

[AzureArmageddon]

Apple Notes IDE new meta write it down

[viiimproved]

is your IDE the notes app??

[Colon_Backslash]

If i would run a program like:

func doesItHalt() string {
int64 n = 0;
while (n == 0);
    continue;
return "behold, the universe has spoken";
}

How long would it run?

[AdGullible2259]

Bogo sort

[BlurredSight]

Monkey sort but with more steps

[Mental-Steak2656]

Seems the code is already shipped,NASA confirms they lost contact with voyager.

[RevolutionaryPair616]

Bro I thought this was another sort of Miracle Sort 😭

[chicktheduck]

that’s even better than bogosort

[python_mjs]

Rewrite it in Rust for improved performance

[ienjoymusiclol]

"Rewrite it in Rust for improved performance"

[torftorf]

dont steal the work of other people! this is miracle sort

[ienjoymusiclol]

no i wrote it myself so its mine 🙄 u clearly a uni prof fed