3 ms·
Yes, I agree with you that unordered_map should be slower. For context, the author shows off a graph where his custom Fibonacci implementation is the fastest, w
by allenz 8y ago
Yes, I agree with you that unordered_map should be slower. For context, the author shows off a graph where his custom Fibonacci implementation is the fastest, which proves nothing about Fibonacci hashing.
- stochastic_monk 8y agoI had an application several years ago in which the executable was 10x as fast when using khash instead of std::unordered_map.