Re:Perl 11
by Arkanosis on Wednesday October 24, 2018 @06:10AM
(#18291051)
Lookup in a trie is O(L) where L is the length of the key; not that different if you take into account that to lookup into a hashtable, you also have to compute the hash of the key.
[ Parent
| on HN ]
There are no comments on this comment yet.