There have been multiple accounts created with the sole purpose of posting advertisement posts or replies containing unsolicited advertising.
Accounts which solely post advertisements, or persistently post them may be terminated.
nothacking , 1 hour ago Just add a delay that pads it out the execute time to 10 seconds. O(1) ez.
Just add a delay that pads it out the execute time to 10 seconds. O(1) ez.
bradorsomething , 2 hours ago Great, now I’m hungry for apples.
Great, now I’m hungry for apples.
Venator , 2 hours ago Why would you want a specific time complexity? Wouldn’t it be better if it’s faster?
Why would you want a specific time complexity? Wouldn’t it be better if it’s faster?
RonSijm , 4 hours ago O(n)? More Like Oh(No)
O(n)? More Like Oh(No)
O(n)
Oh(No)
MajorHavoc , 5 hours ago There’s O(1), O(n), O(nlgn), O( this code is crap ).
There’s O(1), O(n), O(nlgn), O( this code is crap ).
CanadaPlus , 1 hour ago [Cries in matrix multiplication]
[Cries in matrix multiplication]
BleatingZombie , 5 hours ago That’s still good! I’m proud of you for working though the parts of the problem that you were capable of
That’s still good! I’m proud of you for working though the parts of the problem that you were capable of
joyjoy , 8 hours ago O(n!). I like it.
O(n!). I like it.
palordrolap , 5 hours ago O((2^(n^2))!) or bust.
O((2^(n^2))!) or bust.
CanadaPlus , 1 hour ago (edited 1 hour ago) O(BB(n)) “That matches no single computable function” is just an excuse.
O(BB(n))
“That matches no single computable function” is just an excuse.