Set Iterators

Question

We can iterate all elements in a set using iterators... for example:

set <int> s;
.
.
.
for (set<int> :: iterator it = s.begin(); it != s.end(); it++)

what is the time complexity if we have n element in "s"?
what does "it++" do exactly?

Answer 1

https://www.geeksforgeeks.org/iterators-c-stl/