set<int> s;

s.insert(1);
s.insert(2);
...
s.insert(n);

I wonder how much time it takes for s.find(k) where k is a number from 1..n? I assume it is log(n). Is it correct?

c++ stl find set
Edit
Report