DEV Community

Cover image for Big-O Explained
Jacob Clark
Jacob Clark

Posted on

Big-O Explained

Top comments (5)

cclaudiu24 profile image

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..

rubyandcoffee profile image
Alexandra Wolfe

Great article, thank you for writing!

zasuh_ profile image
Žane Suhadolnik

Thank you for the explanation and the links for further reading.

fernandosendmail profile image

Really clear examples, this is great starting point on the whole theory of algorithm complexity, thanks for sharing this 👍

jess profile image
Jess Lee

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.