Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

No, you're 100% correct.

O(n^[number]) = polynomial, with O(n^2) being quadratic.

O([a number]^n) = exponential.

I guess the authors aren't big on CS fundamentals?



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: