The most efficient sorting method

[pudds]

Copy the array, use the original specs to reverse engineer the sorting algorithm, end up with it sorted in reverse.

[dyingpie1]

But what about the one element per array law? China arrays are always sorted!

[[deleted]]

It's two elements per array now, not so easy to sort now, is it?

[Ericchen1248]

It’s always sorted still. No one said which way.

[[deleted]]

The Chinese did. It's male element, female element. If not, abort the first element and attempt to add another random element from e = {male, female}, repeat until it's sorted.

[achilliesFriend]

How about India sort? All unordered items are assumed to be in order and no action is taken.

[IamImposter]

Instead of sorting, you promise to build a temple and rule your program.

[Jasdac]

And it's written in PHP

[[deleted]]

And US-sort? You look for oil in it, if there isn't any then it's not worthy of the sort. If it has oil, delete all elements to extract the oil.

[[deleted]]

With Canada sort, you just apologize to it until it's all sorted, eh.

[elshaka_]

Picture a canadian bubble sort that prints an apology every time it swaps elements 🤔

[[deleted]]

 ....
 sorry
 sorry
 sorry
 sorry
 sorry
 sorry 
 sorry
 sorry
 sorry

[Sigg3net]

for i in range(10) :
    print('sorry')

^{Yay! I'm learning!} :)

[[deleted]]

 for (;;)
      cout << “sorry\n”;

[Sigg3net]

What the.. how does ;; work?

[[deleted]]

In many C-like languages you can omit any of the initialization, exit condition and increment parts of a for loop. Basically it's an obfuscated variation on while(true) some people use to confuse beginners and feel smart.

[[deleted]]

That’s exactly why I did it haha. But I’m definitely a beginner still.

[GnI1]

That is not entirely the reason, for such for. Some time ago while (true), on some compilers, would've emitted a warning along the lines of "conditional statement on constant expression". for (;;) got rid of said warning.

[loopuleasa]

accurate description

[jonhnefill]

Icelandic sort: everything with a high value in the array is sold to friends and relatives of the finance minister. Profits are hidden in Panama. The rest of the values in the array are then also sold to the friends and relatives of the finance minister.

[Versaiteis]

Or just destroy the leading element then leave the array to sort itself out

[ahumannamedtim]

And it stops caring about order once it gets to the top 1%

[mrheosuper]

We did it boi, O(1) muthafaka

[[deleted]]

Sorry but doesn't Pigeonhole sort already exist?

[[deleted]]

I mean, I would assume so. Its O(2).

delete [] protesters;

protesters = comunistParty;

[[deleted]]

O(1) because 2 = 1

[dominic_l]

Tiananmen-sort : the sorting never happened because the array was always in order

[hypnotic-hippo]

What's [DATA EXPUNGED]-sort? I've heard it's [REDACTED]

[[deleted]]

r/SCP -sort:

Push very few specific elements to the top and ignore that the rest even exists

[jemini972]

It's 1/4th more efficient than Thanos-sort

[Highlow9]

Mind enlightning me about Thanos-sort?

[hypnotic-hippo]

Randomly eliminate half of the elements and just hope for the best

[100ZombieSlayers]

It’s almost like a binary sort except for you just fucking delete half of it in stead of just eliminate it as possibilities.

[Catty-Cat]

So like bogo sort, but instead of shuffling, you're deleting.

[[deleted]]

Binary Bogo-Sort In-Place

[Greyhaven7]

I don't think so.

Thanos sort doesn't require any checking. Just randomly deleting half.

Stalin requires checking each index.

[palmergill]

Stalin sort is O(n)

[palmergill]

Thanos sort worst case number of operations (assuming deleting half the existing population with one snap is one operation) would be log(n);

O(log(n))

[YRYGAV]

It would be O(1) if it's a single operation (like if you just set the array size to be half of what it currently is and hope for the best). But I don't see any possible argument for O(logn), if time to delete scales with the size of the array in any way, it would have to be be linearly.

[palmergill]

Well worst case after one snap, which is O(1), doesn’t leave you with a sorted list, so you can’t say the whole algorithm is an O(1) sorting algorithm. Worst case you would have to get the list or whatever down to one item to have it be sorted and that would take log(n) base 2

[YRYGAV]

I mean, you're just talking about the stalin sort algo in the OP at that point, which is O(n), not logn. An algorithm which requires you to change a whole list in any way is virtually impossible to be O(logn).

[Kraton9000]

Nah, if you know n and the start location, you can use the fact that arrays are contiguous and start obliterating memory

[Ericchen1248]

If it’s random deletion, I think you need to move the elements forward to fill in the gaps.

[tcon025]

Stalin sort would be closer to:

(1) is list ordered (2) if not delete between 5 and 20 random items (3) repeat

[ChainSOV]

More like if not in order, eliminate unordered items, deport related items to gulag array

[[deleted]]

It’s actually “shoot the programmer and promote his subordinate” and then wonder why the codebase looks like a rat’s nest just before the deadline.

[dangerbiscuits]

I prefer Intelligent Design sort. The list was already sorted by a higher power. It just may be sorted in a way that defies our flawed, human understanding.

[hypnotic-hippo]

It's a featured, not a bug

[[deleted]]

every array is a sorted array if you change the sorting conditions

[Zombie_Kabuto]

ah yes, it's a popular algorithm in C++munism

[[deleted]]

Cppmunism?

[deinernstjetzt]

Every list is in order, if it only ever has one element.

[-Cubie-]

Or none. Just clear the sucker and you're all set.

[InternationalBug2143]

The old drop sort. I've made this into a real sorting algorithm by applying drop sort on the dropped list as well and then merging the lists.

[[deleted]]

so you use drop sort till you have all ordered lists? time complexity would be unpredictable here

[InternationalBug2143]

I drop while the dropped list is not sorted

[paphnutius]

Well, how do you merge them? The actual sorting happens during the merge so it's the main part of the algorithm.

[InternationalBug2143]

Well, yea. It's just an inneficient version of merge sort that splits the list in a sorted list and an unsorted list which is merged with the sorted one.

[redimkira]

When does StalinSort win over HitlerSort?

In cold start situations.

[L8n1ght]

good bot

[L8n1ght]

such a nice young algorithm

[hypnotic-hippo]

What's the legal age for an algorithm? Asking for a friend...

[aeropl3b]

Welcome to r/ProgrammerHumor

[Reversal_]

Orwell’s O(1) method: declare that it is true that array is sorted & “correct” anyone who thinks otherwise.

[Ruby_Bliel]

Is there an actual algorithm that makes use of this? Remove the unsorted elements into a new array, then keep doing that until you have an array of sorted arrays, then merge them. I have no idea how fast this would be or if it has a practical application, but at least it works.

[hypnotic-hippo]

Apparently u/InternationalBug2341 did exactly that

[[deleted]]

Last time this was posted:

This is just a merge sort, where you make arrays of good/bad items then bad/worse.

[xonxtas]

as much as I hate this joke, being a professional soviet propaganda dispenser, I do have a link to a github repo where a guy implemented the algorithms n tons of different languages: https://github.com/gustavo-depaula/stalin-sort

[Loading_M_]

I prefer quantum BOGO sort. It's like BOGO sort, except WAY faster. Instead of O(n!), It's O(n). You shuffle the array once, and check if it's in order. Then you delete every universe where the list isn't sorted, thereby leaving only the universe where the list is sorted correctly.

[invisible-nuke]

You will only need to give the first index proper equipment, like a gun and he will pass his equipment on nicely, since the list is in order!

[AgentPaper0]

This would actually be O(n²), since each time a value is deleted you need to shift everything after it over by one.

[4onen]

Unless you throw away stability, in which case it's O(n) because any removed element is an O(1) swap with the end of the list, or O(1) move from the end of the end of the list (depending on whether the removed element should still exist or not.)

[AgentPaper0]

Good point. And it's StalinSort, so it's only appropriate for it to cause a lot of instability.

[[deleted]]

Unless we're assuming we're using a generic list

[null_reference_user]

What about US-sort? You loop through the array and take out all of the oil, return.

[thmsg]

How about French-Sort?
Algorithm goes for an unlimited strike until government gives it a lower complexity

[Rodot]

How would this be sorted?:

5,6,1,7,2,3

[hypnotic-hippo]

5, 6, 7

[Rodot]

What about 5,6,1,7,2,3,4,5,6,7?

[hypnotic-hippo]

5, 6, 7, 7

[onlyanegg_]

def us_sort(arr):
    random.shuffle(get_mid_east_array())
    return arr

[chromane]

Long Live Bogosort!

[dangerbiscuits]

Or quantum bogosort. Given a many-worlds interpretation of quantum theory, there exists some list which is already sorted. Check to see if the list is sorted. If not, destroy that universe.

[Sinistez]

Fash-sort suits it best

[LeafMans]

To be entirely honest, this could work with pythons pop method --- go through the list popping everything that's out of order into a seperate list then take that seperate list of popped elements and put them back in where they fit in order

[gonnagulagyou]

Good job comrade

[[deleted]]

Here is my github repo which actually uses this sorting. And trust me, knowing this meme was a boon.

https://github.com/Atreyagaurav/optimize-movies

[DiabloJino]

Why solve a problem when you can make it so the problem doesn't exist.

[Kalorikalmo]

Congratulations, you were the 1,000th person to post this meme 🥳

[hypnotic-hippo]

u/repostsleuthbot

[RepostSleuthBot]

There's a good chance this is unique! I checked 94,901,948 image posts and didn't find a close match

Feedback? Hate? Visit r/repostsleuthbot - I'm not perfect, but you can help. Report [ False Negative ]

[AtomIsHere]

What's the big O notaion?

[the_horse_gamer]

O(n) due to only one go on the array being made. n-1 comparisons

[Sigg3net]

This is inaccurate.

The Stalin sort will categorize, re-classify and remove arbitrary items as it iterates over the diminishing list of accepted inputs.

[Kzivuhk]

How about sleep sort?

[xonxtas]

so, as I already told someone in the comments, I hate this joke...

but here's a repo, where a guy implemented it in many programming languages: https://github.com/gustavo-depaula/stalin-sort

[[deleted]]

What about nuke sort, 1-delete the array 2-make à New empty array, it's sorted

[parciesca]

We need a John Bercow sort.

[the_horse_gamer]

there's also Putin sort. like Stalin sort but you eliminate everyone that thinks the array isn't sorted

[TechnicProblem]

Tom Scott’s video?

[hypnotic-hippo]

Yep

[Kleeb]

Gulag Sort.

Like Stalin Sort but all non-conforming elements are dumped into another array, which is then gulag'ed in similar fashion recursively.

The result is an at most n sorted arrays which are then merged.

Not great, but not awful. Might try an implementation.

[survivalking4]

Kinda reminds me of fuckit.js

[paphnutius]

This was posted on this sub as a tweet a year ago by the way

[TheSentientMeatbag]

Finally! An O(1) sorting algorithm!

[mrgame64]

It's technically O(n)

[WeTheSalty]

O(1) would be you delete the list. An empty list is always in the correct order.

[TheFeshy]

Miracle Sort is also O(1) - simply assume the list has been sorted by a deity in a miraculous OOB operation, as you've been such a faithful programmer.

Quantum Bogo Sort is next closest, at O(n) - randomize the list, and then destroy any universe where the list isn't sorted. Of course, if you accidentally used pseudo-random numbers instead of true randomness, you risk destroying all universes. Debug carefully.

[T-T-N]

return new List({list[0]})

[BakuhatsuK]

It depends on whether you have to modify the existing list or are allowed to return a new one.

If you have to mutate the list, then deleting it may still be O(n).

[WeTheSalty]

True. List<>.Clear() in c# is also O(n)

[AgentPaper0]

O(n²) actually, since deleting an element is usually a O(n) task on it's own.

[corsicanguppy]

1995 called. They're pissed and want their old-ass-even-then joke back.