Why lookup in SortedDictionary<> is SLOWER than lookup in Dictionary<>?

Question

As as human I always thought that lookup in something sorted is the way faster than lookup in not sorted.

But looking at this http://dotnetperls.com/sorteddictionary I can say that I was wrong.

Maybe anyone can explain why it is so ?

Answer 1

The unsorted dictionary is probably a hash map so lookup is almost O(1) assuming not too many collisions, while a lookup in a sorted list is best case O(log N)