title: Asymptotic complexity of .NET collection classes
body: <p>Are there any resources about the asymptotic complexity (big-O and the rest) of methods of .NET collection classes (<code>Dictionary&lt;K,V&gt;</code>, <code>List&lt;T&gt;</code> etc...)?</p>
  
  <p>I know that the C5 library's documentation includes some information about it (<a href="http://www.itu.dk/research/c5/Release1.1/c5doc/types/C5.LinkedList_1.htm" rel="noreferrer">example</a>), but I'm interested in standard .NET collections too... (and PowerCollections' information would also be nice). </p>