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

It's not, no. Whats your point? The factorization step is still O(1).



You can't factorize a number in O(1) if it takes O(n) or whatever to set up the problem.

Everything is O(1) if you can ignore steps.




Join us for AI Startup School this June 16-17 in San Francisco!

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

Search: