Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mkl
on July 22, 2022
|
parent
|
context
|
favorite
| on:
Ask HN: What are some cool but obscure data struct...
Why subdivide so far? I find it better to have leaf nodes contain an array of up to some small number of points, e.g. 20. That reduces the pointer chasing significantly, and a linear search through such a small array is very fast.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: