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

100n^3 and 30n^3 are both O(n^3)...no improvement, hence it won't be published. Depending on the problem the algorithm is solving O(n^3) to O(n^2) can be a massive improvement.


Constant-time factors matter to everyone working with finite resources.




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

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

Search: