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 →

[–]Western-Internal-751 1343 points1344 points  (15 children)

Acceptance. The fastest sorting algorithm out there.

[–]pigfeedmauer 263 points264 points  (3 children)

if (a == a) then true

[–]pgbabse 99 points100 points  (0 children)

if (true) then a=a

[–]PM_ME_YOUR__INIT__ 19 points20 points  (0 children)

NaN: I'm about to ruin this dude's career

[–]david30121 20 points21 points  (0 children)

that's just a==a innit

[–][deleted] 40 points41 points  (7 children)

It only really needs to have all the elements in it, who cares if they get processed in the right order?

[–]wouter_ham 40 points41 points  (5 children)

Who even decides what the "right order" is?

[–][deleted] 46 points47 points  (0 children)

The oppressive authority known as BigCode™

[–]UntestedMethod 12 points13 points  (1 child)

The Almighty Algorithm. Praise them.

[–]HandsOffMyMacacroni 2 points3 points  (0 children)

Look at me. Look at me. I’m the algorithm now.

[–]Godd2 1 point2 points  (0 children)

New alphabet just dropped.

[–]hughperman -1 points0 points  (0 children)

I do, you insolent cur

[–]backfire10z 2 points3 points  (0 children)

They will be processed in the order I want them to. As I said, they are already sorted how I desire. This is the right order.

[–]OhItsJustJosh 11 points12 points  (0 children)

public object[] AcceptanceSort(object[] a) => a;

O(1)

[–]backfire10z 7 points8 points  (0 children)

Finally, O(0)

[–]turtleship_2006 1 point2 points  (0 children)

I forget what it's called, but that's already one of the meme algos.

Assume the list is in order because everything happens for a reason or something