45
Time Complexity
•Hashed associative containers have unit time complexity, on average. This is good for fast lookup of individual elements. (But note that execution behavior of a hashed container is very sensitive to quality of hash function.) •Ordered associative containers have logarithmic time complexity, even in the worst case. This predictability is safer for real-time systems. Ordered containers are good for iteration over ranges of elements.