Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need a algorithim to generates a unique hash, not necessirily fixed length, for a integer such that it is independent of permutations of digits.
Like, the hash of 123, 321, 312, 213… should be the same. (Ignore the leading zeroes)
What I tried was to raise every digit to itself and sum up. Like,
Hash(321) = 3**3 + 2**2 + 1**1
Now, I am not sure whether it will generate collissions or not and there is, certainly, a performance issue for large numbers. Any alternatives?
One option: Sort the digits. 123, 321, 312, and 213 all go to 123.
Another option: Use a vector of the counts of each digit as the hash. 123, 321, 312, and 213 all go to [0,1,1,1,0,0,0,0,0,0].