• Sign in
  • Sign up 
  • Welcome
  • FAQ
  • Block Explorer 
  • Night Mode
  • Stolen Accounts Recovery 
  • Change Account Password 
  • Vote for Witnesses 
  • Hive Proposals 
  • OpenHive Chat 
  • Developer Portal 
  • Hive Whitepaper 
  • Privacy Policy
  • Terms of Service
logo
  • Posts
  • Proposals
  • Witnesses
  • Our dApps
LoginSign up

baiyunping333 (25)Hivebuzz level badge

229 followers1 post26 following1 HP
Blacklisted Users
Muted UsersFollowed BlacklistsFollowed Muted Lists

Joined January 2018 Active 8 years ago

  • Blog
  • Posts
  • Replies
  • Social
  • Notifications
  • Wallet
  • baiyunping333 (25)in #cn • 8 years ago
    featured

    hash函数为什么要选择对素数求余

    常用的hash函数是选一个数m取模(余数),这个数在课本中推荐m是素数, 但是经常见到选择m=2^n,因为对2^n求余数更快,并认为在key分布均匀的情况下, key%m也是在[0,m-1]区间均匀分布的。但实际上,key%m的分布同m是有关的。 证明如下: key%m = key -…
    $0.00
       2 2