anon - June 2, 2012, 1:03 p.m.
A hashtable for strings is always slower than a trie. In a hashtable you have to process the string with the hashfunction, and then acess the table. With a trie one can retrieve information just by processing the string.
with Markdown syntax.
Comments are not displayed until they are approved by a
moderator. Moderators will not approve unless the comment
contributes value to the discussion.