Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nostrademons
on May 4, 2013
|
parent
|
context
|
favorite
| on:
Big-O Algorithm Complexity Cheat Sheet
Right. Basically, if the key size is bounded, then k becomes a constant and it reduces to O(N).
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
