String Lookup: Hash, Sorted or Unsorted ?

[DP News-Robot]

When looking up a string, what is the fastest strategy? A hash map, a sorted list or an unsorted list? Of course it depends on how many strings you have, but where are the cutoff points? Here is a quick test, and an interesting tidbit is uncovered… Without further ado, here is the result ...http://www.delphipraxis.net//feeds.f...~4/VtuP9SQebeE

More...