Home/ Questions/Q 8559517
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-11T16:04:06+00:00

I want to hold a list of strings which performs well when searching for

  • 0

I want to hold a list of strings which performs well when searching for a specific element. As mentioned in the following cheat sheet, Dictionary scales best for this type of operation: http://courses.essex.ac.uk/ce/ce318/www/documents/references/cSharpDataStructuresCheatSheet.pdf
However, I don’t need a dictionary as I’m only storing strings, not key value pairs (i.e. I’m only interested in the keys). Does anyone know what data structure the dictionary uses for its keys? KeyCollection seems to only be available to Dictionary. My guess is it’s using some sort of hashing algorithm, but wondered if anyone had any insight on this?
Thanks in advance.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You could use a HashSet<string>.

    • 0