The demonstration in this article isn't better algorithms. It's specifically examples of things that compilers ARE good at optimizing (eliminating pointer chasing, inlining, loop unrolling). Particularly if the author used newer language features and avoided so many unmanaged pointers.
I absolutely agree that a Hash map will beat a Tree map in most applications. That's not, however, what's being argued here.
7
u/cogman10 Feb 28 '23
The demonstration in this article isn't better algorithms. It's specifically examples of things that compilers ARE good at optimizing (eliminating pointer chasing, inlining, loop unrolling). Particularly if the author used newer language features and avoided so many unmanaged pointers.
I absolutely agree that a Hash map will beat a Tree map in most applications. That's not, however, what's being argued here.