O'Reilly logo
  • Ismael Lanchas thinks this is interesting:

In big-O notation, retrieval time by key is:

  • O(1) for Hashtable, Dictionary, and OrderedDictionary

  • O(log n) for SortedDictionary and SortedList

  • O(n) for ListDictionary (and nondictionary types such as List<T>)

From

Cover of C# 6.0 in a Nutshell, 6th Edition

Note

Comparación de rendimiento según la implementación escogida.