Performance comparison of Dictionaries

Question

I'm interested in performance values (big-O analysis) of Lookup and Insert operation for .Net Dictionaries (generic or not): HashTable, SortedList, StringDictionary, ListDictionary, HybridDictionary, NameValueCollection, SortedList < T, U >, Dictionary < T,U >

Link to a web page with the answer works for me too.

Why are you even looking at non-generic collections, rather than those in `System.Collections.Generic`? Is there any particular reason? — Pavel Minaev, Apr 14 '10 at 07:41

score 2 · Answer 1 · answered Apr 14 '10 at 08:23

2

It is documented on MSDN, see for instance the Remarks on this page.

answered Apr 14 '10 at 08:23

H H

263,252
30
330
514

Performance comparison of Dictionaries

1 Answers1