S [zero] * 31 ^ (n-1) + s [1] * 31 ^ (n-2) +. + s [n-1] Using this algorithm for hash
Source: Internet
Author: User
S [0] * 31 ^ (n-1) + s [1] * 31 ^ (n-2) +... + s [n-1] Using this algorithm hashs [0] * 31 ^ (n-1) + s [1] * 31 ^ (n-2) +... + s [n-1] How about hash using this algorithm? How to detect conflicts? When my s [0] * 31 ^ (n-1) + s [1] * 31 ^ (n-2) +... + s [n-1] use this algorithm for hash
S [0] * 31 ^ (n-1) + s [1] * 31 ^ (n-2) +... + s [n-1] Using this algorithm for hash
How is it?
How to detect conflicts?
When I am a fixed-length string, for example, 10 characters
What is the conflict?
It is said that this algorithm is in java's hashcode and does not know, right? Let me publish the java version.
------ Solution --------------------
Hash conflicts of massive data are inevitable. Generally, when a conflict occurs, the ordered list is used.
If you do not reserve storage space for conflicts, most of them will be unrecoverable.
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.
