You get better algorithmic performance, but whether a tree or a linked list you ... | Hacker News

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

		veltas on Oct 18, 2021 \| parent \| context \| favorite \| on: Implementing Hash Tables in C You get better algorithmic performance, but whether a tree or a linked list you get bad locality versus open bucket.

winrid on Oct 19, 2021 [–]

You can get good cache locality with a tree depending on the implementation.

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