asymptotic-complexity

Are there any resources about the asymptotic complexity (big-O and the rest) of methods of .NET collection classes ( Dictionary<K,V> , List<T> etc...)? I know that the C5 library's documentation includes some information about it ( example ), but I'm interested in standard .NET collections too... (and PowerCollections' information would also be nice). MSDN Lists these: Dictionary<,> List<> SortedList<,> (edit: wrong link; here's the generic version ) SortedDictionary<,> etc. For example: The SortedList(TKey, TValue) generic class is a binary search tree with O(log n) retrieval, where n is the

What is the difference between Big-O notation O(n) and Little-O notation o(n) ? Tyler McHenry f ∈ O(g) says, essentially For at least one choice of a constant k > 0, you can find a constant a such that the inequality 0 <= f(x) <= k g(x) holds for all x > a. Note that O(g) is the set of all functions for which this condition holds. f ∈ o(g) says, essentially For every choice of a constant k > 0, you can find a constant a such that the inequality 0 <= f(x) < k g(x) holds for all x > a. Once again, note that o(g) is a set. In Big-O, it is only necessary that you find a particular multiplier k for