3 ms·
I have never seen a true described as easier than a hash table. Curious what makes you say they are easier?
by taeric 6y ago
I have never seen a true described as easier than a hash table. Curious what makes you say they are easier?
- tengbretson 6y agoI find their performance characteristics easier to naively understand without resorting to profiling with production data.
- taeric 6y agoI should have worded my question more as "do you have a recommendation to describe tries?" In particular, construction is tough.
- tengbretson 6y agoThe C# implementation here is pretty approachable for just about any kind of programming background. https://www.geeksforgeeks.org/trie-insert-and-search/ https://www.geeksforgeeks.org/trie-insert-and-search/