Question: why does the size of strings can be treated as constant when considering the complexity of the hash function because, while names vary in size,
why does the size of strings can be treated as constant when considering the complexity of the hash function because, while names vary in size, we do not expect their average size to grow as we insert new elements into the hashtable?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
