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 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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?