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.
Felt like today was super simple. Biggest issues was with setting cycle = 0 at the start instead of 1
There is most likely a way to do it by just adding the cycles all at once, instead of actually "waiting" for every cycle, but sounds like too much effort. and you would have to loop for every cycle anyway to draw the screen, so that shouldn't change complexity at all.
Jump in the discussion.
No email address required.
That was a mistake. You're about to find out the hard way why.
Jump in the discussion.
No email address required.
even my shortest solution so far gets bullied by the bot
Jump in the discussion.
No email address required.
that's ur fault for using c++
Jump in the discussion.
No email address required.
More options
Context
More options
Context
More options
Context
More options
Context