Question

explain Coalesced hashing with example​

Answer 1

Answer:

Coalesced hashing is a technique for implementing a hash table. It's an open addressing technique which means that all keys are stored in the array itself (e.g. it doesn't use for example linked lists to handle collisions). ... Example: Coalesced hash table holding five keys in two collision chains.

Explanation:

Please mark as the brainliest answer

Follow m.e