Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
psykotic
on Dec 1, 2015
|
parent
|
context
|
favorite
| on:
An interesting data structure with search time O(s...
From some homework I did as a freshman, I remember another neat data structure with O(sqrt(n)) search:
https://ece.uwaterloo.ca/~dwharder/aads/Algorithms/Beaps/
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: