C++ Hash Table Performance

Understand behaviors of hash tables in C++ so we can use them more correctly.

Photo by Emile Perron on Unsplash

People often talk about how one type of data structure is better than another, such as hash tables. It has operations such as insert, retrieve and delete which have O(1) time complexity and O(n) space complexity. That’s what we understand from the theory we learn. But in practice, that theory is not very precise, some details are missed…