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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
What Is The Complexity Of Set In C++
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.
Название |
---|