Page# 207 in ebook under an application of hash table" section, it says
“there are n insertions into the hash table”
"the insertions add a time complexity of O(nm), yielding O(nm logm) time complexity in total.
Shouldn’t insertions be only O(n) as it’s O(1) per insertion on average?
Page 203 has code:
hash_code ^= hash<string()(name)
Can someone point to how one could figure out what this means?
If it means operator () on the “template< class Key > struct hash” then shouldn’t it be:
hash(name) as the argument to operator () is a string. Why is empty brackets () correct?