3 ms·
> However, this data structure is incredibly much faster than the "O(log n)" people are generally used to. Is it? I'll bet it's actually much slower than famil
by millstone 12y ago
> However, this data structure is incredibly much faster than the "O(log n)" people are generally used to.
Is it? I'll bet it's actually much slower than familiar O(log n) operations like binary search, in particular due to the memory allocations.
- weavejester 12y agoIf you're comparing a binary search to a lookup on a Clojure hashmap, there should be no memory allocations necessary.