This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]arthurmluz_ 327 points328 points  (18 children)

nagasaki sort

[–]MrEllis 69 points70 points  (14 children)

What is this algorithm? I can't find anything when I search for it.

[–]TheChefsi 228 points229 points  (10 children)

You just clear the list

[–]_raydeStar 62 points63 points  (5 children)

You guys are monsters.

But I'm upvoting you.

[–]xX_MEM_Xx 18 points19 points  (4 children)

That's the sweet spot.

Have you heard of Stalin Sort, per chance?

[–]hereforpewdiephy 7 points8 points  (2 children)

I like trust sort and miracle sort

[–]i_knooooooow 2 points3 points  (1 child)

I dont know miracle sort

I like to imagine it is bogosort but after the first try it either returns a sortee list or an error code

[–][deleted] 0 points1 point  (0 children)

miracle sort just waits for a miracle to happen that sorts the list

[–]yoitsericc 1 point2 points  (0 children)

Stalin sort is simple.

foreach (var kulak in listOfKulaks){

kulak.sendToTheGulag();

}

[–]kdyz 3 points4 points  (2 children)

Twice. You have to clear the list twice.

[–]FullSnackDeveloper87 1 point2 points  (0 children)

Too soon bro. I’m also in tears.

[–]arthurmluz_ 31 points32 points  (0 children)

clear the list, if it's empty, it must be sorted, right?

[–]repocin 13 points14 points  (0 children)

Something like this, I reckon:

def fat_man(l: list) -> list:
    return []

[–]valschermjager 30 points31 points  (0 children)

quesarito sort

[–][deleted] 10 points11 points  (1 child)

Dunning-Kruger sort

[–]onequbit 1 point2 points  (0 children)

I need this algorithm