What is a potential performance issue with unordered_map if a poor hash function is used?
Memory fragmentation.
Increased cache misses.
Performance degrades towards O(n) for lookups.
Increased collisions and slower lookups.
This question is part of this quiz :
C++ Unordered Map