Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
shpongled
on June 24, 2024
|
parent
|
context
|
favorite
| on:
B-Trees Require Fewer Comparisons Than Balanced Bi...
Definitely depends on the branching factor! There are other encodings like Eytzinger that can provide further improves over "standard" binary search too [1].
[1]
https://en.algorithmica.org/hpc/data-structures/binary-searc...
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://en.algorithmica.org/hpc/data-structures/binary-searc...