Okay it isn't even out yet, I'm sure it will be great, and the elves are in trouble, etc. I'm just beating you all to the bunch so I can tell you to explain your answers, we care about ALGORITHMIC COMPLEXITY now. What's the fastest and most efficient way to do it.
heymoon wtf is a big o
This is O(n)
x = REALLY_BIG_NUMBER
for i in range(x):
process(i)
This is O(n^2)
x = REALLY_BIG_NUMBER
for i in range(x):
for j in range(x)
process(i,j)
There's more to it but that's the quick version. Also there are things like O(log(n)) (based), O(a^n) (cringe), and O(n!) (advanced cringe).
Okay, post ur code too but explain why its cool or no one will read it. I'll pin my favorite answers, other mods also do this
Jump in the discussion.
No email address required.
raw code pretty much did remove some comments
Jump in the discussion.
No email address required.
Jump in the discussion.
No email address required.
oh its the marsify award hitting "return to monkey"
Jump in the discussion.
No email address required.
yup lol
Jump in the discussion.
No email address required.
More options
Context
More options
Context
More options
Context
Mommy is soooo proud of you, sweaty. Let's put this sperg out up on the fridge with all your other failures.
Jump in the discussion.
No email address required.
More options
Context
More options
Context