/* My variation of Bernstein algorithm:
1. Perfect hashing for a string consist of no more than 6 symbols of the same type.
For example, alphabetic only or numeric only, but not alphanumeric....
Type: Posts; User: zub
/* My variation of Bernstein algorithm:
1. Perfect hashing for a string consist of no more than 6 symbols of the same type.
For example, alphabetic only or numeric only, but not alphanumeric....
I suggest to turn once the string to a number and then compare the numbers. This is called hashing. For such short strings even perfect hashing (when two different strings never generate the same...