For further actions, you may consider blocking this person and/or reporting abuse
For further actions, you may consider blocking this person and/or reporting abuse
Robert Mion -
Seraph★776 -
FakeStandard -
Ikechukwu Vincent -
Once suspended, imjacobclark will not be able to comment or publish posts until their suspension is removed.
Once unsuspended, imjacobclark will be able to comment and publish posts again.
Once unpublished, all posts by imjacobclark will become hidden and only accessible to themselves.
If imjacobclark is not suspended, they can still re-publish their posts from their dashboard.
Once unpublished, this post will become invisible to the public and only accessible to Jacob Clark.
They can still re-publish the post if they are not suspended.
Thanks for keeping DEV Community safe. Here is what you can do to flag imjacobclark:
Unflagging imjacobclark will restore default visibility to their posts.
Top comments (5)
how come this expression evals to false: "n 2 <= 1 * 4 for 1 > 0, we can see that this is now false" ?
also if chose for O(n^2) case c to be 1 then why do you write it as 3?
"3<=3*3^2, for 3>0 which is true, but the truthy applies also to 1st expression where you say it s falsy..
Great article, thank you for writing!
Thank you for the explanation and the links for further reading.
Really clear examples, this is great starting point on the whole theory of algorithm complexity, thanks for sharing this 👍
Thank you for breaking down Big O - such a popular topic in bootcamps! I can see it being used as a go to resource for a lot of new developers.