Re:Static search trees: 40x faster than binary search
by kubb on Tuesday December 31, 2024 @09:21PM
(#42563482)
If you can't understand the code snippets in this post, the concepts will most likely be lost on you, no matter what other language would be used for the code.
[ Parent
| on HN ]
Re:Static search trees: 40x faster than binary search
by mangamadaiyan on Wednesday January 01, 2025 @03:14AM
(#42564682)
Isn't that precisely the point that the GP was trying to make, about the accessibility of the article?
Edit: Eytzinger layout, Cache lines, SIMD, et cetera are independent of the particular language used in the article. They're just as valid in C, for example. I don't understand your point about them being tied to Rust.