views:

84

answers:

1

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.

+1  A: 

I think this SO question/answer covers this somewhat and should help get you started.

Daniel DiPaolo
thank you. But what about non-generic dictionaries - the same as for generic?
Hun1Ahpu