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

I like the concept, but the author haphazardly combines asymptotic analysis with unsubstantiated performance benchmarks and uses some imprecise language.

What does "nearly O(1) complexity" mean? Why does he mention a complexity of "O(8sizeof(void ))"? Shouldn't that constant factor be collapsed?



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: