News for hackers. Stuff that matters.
Re:Hitchhiker trees: functional, persistent, off-heap sorted... by tmd83 on Friday August 05, 2016 @11:26AM (#12233016)
When log(n) is within the word size the hashmap lookup for the most part is actually constant i.e., few specific machine operation. A generic log(n) algorithm still requires log(n) distinct operation for the most part however small that number is.

There are no comments on this comment yet.