What's the time complexity of iterating through a std::set
/std::multiset
/std::map
/std::multimap
? I believe that it is linear in the size of the set/map, but not so sure. Is it specified in the language standard?
In the draft C++11 standard N3337 the answer can be found in § 24.2.1 paragraph 8:
All the categories of iterators require only those functions that are realizable for a given category in constant time (amortized).
Since each operation on an iterator must be constant time, iterating through n
elements must be O(n)
.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With