For further actions, you may consider blocking this person and/or reporting abuse
Read next
AI Models Better at Setting Boundaries in English Than Other Languages, Study Shows
Mike Young -
New AI Training Method Makes Robots Learn 30% Better by Keeping Neural Networks on Track
Mike Young -
AI Models Tested on Chinese Dynasty Timeline Knowledge: New Benchmark Shows GPT-4 Leads at 75% Accuracy
Mike Young -
AI Models Help Find Emergency Posts During Disasters Using Less Computing Power
Mike Young -
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.