[fpc-devel] Generic Programming Units
dezobec at tin.it
Tue Jun 21 22:17:16 CEST 2005
Michael Van Canneyt wrote:
>What is the performance difference between a hash() and a binary search on
>an ordered list ? I've also been working with an 'associative' stringlist, but
>I was using an ordered stringlist to keep the data, so a binary search is done.
The TStringList is a very fast class, if you worked with less than
100.000 items you would not notice any difference.
But a Hash Table is also very fast in insertion, while to keep a list
ordered only for searching may be not convenient and slows down insertion.
More information about the fpc-devel