On: Examples of quick hash tables and dynamic arrays in C

[MathMonkeyMan]

Less to write means less to read.

It's comparing apples to oranges. If in C++ you removed allocators, exceptions, references, and generics, then unordered_map would be "quick" too.