0
In a hash table using open addressing with linear probing, what problem becomes more pronounced as the load factor increases?
- APrimary clustering, leading to longer probe sequences and degraded performance
- BThe hash table automatically resizes without any performance cost
- CCollisions become impossible
- DThe table converts to a binary search tree automatically
Correct answer: A