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.
your example is false! those are O(x) and O(x²)
@drama_enthusiast look C 2D arrays! and
operator<<
Jump in the discussion.
No email address required.
I wouldn't pass streams around, I would put everything into a string and then have a separate function push it into a stream at the end.
Code looks good though ( as long as we ignore member functions definitions in a struct(!) )
Jump in the discussion.
No email address required.
More options
Context
what did u say withe man? May I see your n-word loicense?
Jump in the discussion.
No email address required.
got my n word license right here
Jump in the discussion.
No email address required.
More options
Context
More options
Context
More options
Context