Performance comparison of Dictionaries

Posted by Hun1Ahpu on Stack Overflow See other posts from Stack Overflow or by Hun1Ahpu
Published on 2010-04-14T07:39:34Z Indexed on 2010/04/14 7:43 UTC
Read the original article Hit count: 510

Filed under:
|
|
|

I'm interested in performance values (big-O analysis) of Lookup and Insert operation for .Net Dictionaries: HashTable, SortedList, StringDictionary, ListDictionary, HybridDictionary, NameValueCollection

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

© Stack Overflow or respective owner

Related posts about big-o-analysis

Related posts about c#