Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
thisisnotatest
on July 29, 2022
|
parent
|
context
|
favorite
| on:
Ask HN: What are some cool but obscure data struct...
A helpful little heuristic that always stuck with me from a Stanford lecture by Andrew Ng was, "log N is less than 30 for all N".
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
