Hey guys,<br><br>Hash tables are new to me since they have never been part of the C++ standard template library, and having started C++ as my first language I have never been exposed to them. Ever since unordered_map appeared in the Boost library, I&#39;ve been trying to understand how they function in terms of functionality, memory, and performance. A major source of information has been from Wikipedia, specifically <a href="http://en.wikipedia.org/wiki/Hash_table">this page</a>. Below I have outlined a few questions concerning boost::unordered_map:<br>
<ol><li>From what I&#39;ve read, the performance of a hash table is O(1), however it mentions that depending on specific situations it may be O(n). Is this true with unordered map? If so, what conditions would force it to maintain O(n) complexity?<br>
</li><li>What is the memory footprint of an unordered_map? From my research, hash tables seem to be a simple wrapper over an array in that the size of the &quot;internal array&quot; in the hash table will contain as many elements as the largest hash value generated by one of the key elements. So if I put two elements in my hash table and the generated keys are 200 and then 1,000,000, then the hash table would be 1,000,000 elements in size (which is at least a megabyte of memory in the most optimistic scenario). This logic is rather ridiculous and impractical, so I am pretty sure I&#39;m misunderstanding how the memory mechanics work under the hood for an unordered_map.</li>
</ol>Those are the biggest questions I have now and if I think of more I&#39;ll most certainly be providing follow-up posts. I thank everyone in advance for reading and helping.<br>