Asymptotic complexity of .NET collection classes

Question

Are there any resources about the asymptotic complexity (big-O and the rest) of methods of .NET collection classes (Dictionary, List

Answer 1

I don't know in general (the other answer just posted perhaps gives you exactly what you're after) - but you can reflect this and other methods of course using ILSpy (a little awkward with FSharp code, true) and this eventually yields this function as C#:

internal static a maximumElementAux(SetTree s, a n)
{
  while (true)
  {
    SetTree setTree = s;
    if (setTree is SetTree.SetOne)
    {
      break;
    }
    if (setTree == null)
    {
      return n;
    }
    SetTree.SetNode setNode = (SetTree.SetNode)s;
    SetTree arg_23_0 = setNode.item3;
    n = setNode.item1;
    s = arg_23_0;
  }
  return ((SetTree.SetOne)s).item;
  return n;
}

Okay so this is not exactly 'proper' code in C# terms - but the presence of the while(true) loop implies it can't be O(1) at least; as for what it actually is... well, my head hurts too much to find out :)