107 ms·
No. This discussion is about algorithmic complexity, typically counting comparisons. And of course, it ignores constants. If we're counting page accesses, we ca
by geophile 7y ago
No. This discussion is about algorithmic complexity, typically counting comparisons. And of course, it ignores constants. If we're counting page accesses, we care very much about the constants.
And furthermore, a "multi-level hash table" is a tree, except an unordered one. What a useless beast!
- misterman0 7y ago>> What a useless beast! Mostly but not entirely. There are cases where you need a tree but you don't care about order, e.g. when order depends on a state that is unknown at time of writing or when all you want to encode are relationships.
- andrewflnr 7y agoAlso, JSON and its ilk.
- AstralStorm 7y agoYes, mostly. There are better structures with these characteristics like a skiplist, multihashed table (typically double hashed) or extensible hashing.