BKDR Hash

最新推荐文章于 2022-10-09 19:45:58 发布

CaspianSea

最新推荐文章于 2022-10-09 19:45:58 发布

阅读量1.3k

点赞数

分类专栏： Algorithms

Algorithms 专栏收录该内容

99 篇文章

订阅专栏

本文介绍了BKDR哈希函数，该函数源自Brian Kernighan和Dennis Ritchie的著作《C Programming Language》。这是一种使用特定种子序列的简单哈希算法，与DJB哈希函数相似。文章详细展示了BKDR哈希函数的实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This hash function comes from Brian Kernighan and Dennis Ritchie's book "The C Programming Language". It is a simple hash function using a strange set of possible seeds which all constitute a pattern of 31....31...31 etc, it seems to be very similar to the DJB hash function.

unsigned int BKDRHash(const char* str, unsigned int length)
{
   unsigned int seed = 131; /* 31 131 1313 13131 131313 etc.. */
   unsigned int hash = 0;
   unsigned int i    = 0;

   for (i = 0; i < length; ++str, ++i)
   {
      hash = (hash * seed) + (*str);
   }

   return hash;
}