Or maybe, since O(1) is in O(log *n*), you can cover your bases by just calling ... | Hacker News

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

Cushman on July 1, 2015 | parent | context | favorite | on: The Universal Data Structure

Or maybe, since O(1) is in O(log n), you can cover your bases by just calling everything logarithmic regardless :)

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