Swift algorithm Practice (2)

String hash algorithm

Time33 is superior in both efficiency and randomness. For a hash function, the criteria for evaluating its merits should be randomness, that is, the average degree of probability of entering each cell of a hash table for any set of specimens, because the more average the probability, the more evenly the data is distributed in the table, and the higher the space utilization of the table.

TIMES33 algorithm is very simple, is the constant multiplication of 33, see the following algorithm prototype.

hash (i) = hash (i-1) * + str[i]

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Swift algorithm Practice (2)