![]() |
String Lookup: Hash, Sorted or Unsorted ?
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
![]() |
Alle Zeitangaben in WEZ +1. Es ist jetzt 20:02 Uhr. |
Powered by vBulletin® Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
LinkBacks Enabled by vBSEO © 2011, Crawlability, Inc.
Delphi-PRAXiS (c) 2002 - 2023 by Daniel R. Wolf, 2024 by Thomas Breitkreuz