7
votes
Vote UpVote

String Lookup: Hash, Sorted or Unsorted ?

DelphiTools – 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 chart.…
Favorite? Off-Topic? Eric Grange @ 2015-03-16 17:17

Statistics

Visits: 1200
Votes: 7
Favorites: 0
Off-Topic: 1

Visits by Source

User Actions

Users who voted for this posting

Alister Christie
François
Jørn E. Angeltveit
Kryvich
Tim Winstanley
TOndrej
Zzzzz
Subscribe:
Contact us to advertise on DelphiFeeds.com

Community Links

Torry Firebird News

Sponsor

 
Please login or register to use this functionality.
(click on this box to dismiss)