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

big O assumes n is asymptotic and unbounded. But anyway, constant time might be more deterministic which is a good quality.



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

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

Search: