set<int>s;
s.erase(s.begin());
I wanted to know whether removing the minimum element in set is a O(logN) or O(1) operation ?
I am quite confused about this situation.
Thanks in advance..
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
set<int>s;
s.erase(s.begin());
I wanted to know whether removing the minimum element in set is a O(logN) or O(1) operation ?
I am quite confused about this situation.
Thanks in advance..
Name |
---|
It takes amortized constant time. See here set::begin and here set::erase.
Thanks buddy
It says just "constant" (doesn't say about amortisation), but I doubt that's true.
"For the first version (erase(position)), amortized constant." (where position is an iterator) from http://www.cplusplus.com/reference/set/set/erase/
ah, sorry, I just followed Jakube's links, but both of them apparently go to std::set::begin
Yes, I noticed that too :)
Sorry, I fixed the link.