Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ryao
on Jan 1, 2025
|
parent
|
context
|
favorite
| on:
Static search trees: faster than binary search
You have to be 1/3 down the page to see any of this in the code examples. By that point, you would already have seen a number of examples that are valid C code and it is reasonable to expect the rest to be. At least, that was my experience.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: