Most programmers have at least a passing acquaintance with big-O notation. It's a technique that's used to find the upper bound on running time and...
For further actions, you may consider blocking this person and/or reporting abuse
One small correction
N(which isN¹) andN²,N³oraN³ + bN² + cN + detc are all polynomial. Also, there are a bit more complexity classes then those you listed. My favourite video introduction is this one.@stereobooster thank you for your comment and the video! You're right, N1 is indeed also polynomial. I guess even just a constant is also technically a polynomial with N0. So I should have been more precise with the terminology. I think the underlying idea is sound though, namely that, in practice, quadratic (or worse) algorithms are considered to be in a different category from constant, linear, and linearithmic ones.