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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.
Name |
---|
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?