For further actions, you may consider blocking this person and/or reporting abuse
Read next
How to Create an Application to Determine the Palette and Dominant Colors of an Image
Denis Svinarchuk -
3-hydroxypropionic Acid Market share, Market trends, and forecasts from 2024 to 2031.
Akash Sharma -
JS Bites: Chapter 3 - Async/Await vs Promise
Sanjay R -
Produkttest: Corsair K100 Air Wireless
Marco -
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.