set < int > s;
...
for(set < int > :: iterator it = s.begin(); it != s.end(); it++)
doSomething();
What is the complexity of this code? Cost of it++ is O(1) or O(log(n)) or another complexity? Do you have any ideas about it?
Thanks for help.
set < int > s;
...
for(set < int > :: iterator it = s.begin(); it != s.end(); it++)
doSomething();
What is the complexity of this code? Cost of it++ is O(1) or O(log(n)) or another complexity? Do you have any ideas about it?
Thanks for help.
The complexity of full cicle is O(n), however it++ is O(log(n)), but for going over all set its O(n) cause its simply dfs. Soory for bad englando
Correct, amortized constant time.
http://stackoverflow.com/questions/11779859/whats-the-time-complexity-of-iterating-through-a-stdset-stdmap
Thanks!
travelling set?