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.