Hacker News new | past | comments | ask | show | jobs | submit login

Big-O is an upper bound. Something that's O(n) is also O(n^2).



Consider applying for YC's Summer 2025 batch! Applications are open till May 13

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

Search: