Time complexity of std::find() in std::unordered_set or std::unordered_map with no collisions
Question
I know unordered_map has O(1) lookups but std::find() is a searching algorithm(I guess) in other containers.So is it O(1) or O(n) considering there is no collision.
1 answers
solution1
2 ACCPTED 2020-12-03 14:23:51
From cppreference for std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find :
Complexity
Constant on average, worst case linear in the size of the container.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
A std::unordered_map facade for a std::unordered_set - how?
Usefulness of KeyEqual in std::unordered_set/std::unordered_map
When std::map/std::set should be used over std::unordered_map/std::unordered_set?
serialize std::unordered_map < int, std::unordered_set<int> > with boost
Predict resize/rehash of std::unordered_set or std::unordered_map
std::unordered_set::erase complexity
Complexity of std::unordered_set iterator traversal
C++ std::unordered_map complexity
Why std::set / std::map and std::unordered_set / std::unordered_map does NOT have std::erase overload but have std::erase_if?
Will elements added into a std::unordered_set (or unordered_map) during iteration be visited during the iterations?
Related Tags