DEV Community

Discussion on: Big-O: Prime Factors and Pseudo-Polynomial Time

Collapse
 
stereobooster profile image
stereobooster

One small correction N (which is ) and , or aN³ + bN² + cN + d etc are all polynomial. Also, there are a bit more complexity classes then those you listed. My favourite video introduction is this one.

Collapse
 
nestedsoftware profile image
Nested Software • Edited

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