MockP1: - Dividing the item into equal parts and then adding them together to get the hash value
- If it's too big to store, divide by the number of spaces in the table

Question

- Dividing the item into equal parts and then adding them together to get the hash value
- If it's too big to store, divide by the number of spaces in the table

Sozen · Accepted Answer

What is the folding method? (hashing algorithm) and what extra step must be taken if the resulting hash is too large to store on the table?

MockP1

- Dividing the item into equal parts and then adding them together to get the hash value - If it's too big to store, divide by the number of spaces in the table

What is the folding method? (hashing algorithm) and what extra step must be taken if the resulting hash is too large to store on the table?

Author