1 Replies - 1238 Views - Last Post: 13 March 2013 - 11:45 AM

#1 ishan3243  Icon User is offline

  • New D.I.C Head

Reputation: 1
  • View blog
  • Posts: 17
  • Joined: 29-October 12

simple uniform hashing(SUH)

Posted 13 March 2013 - 01:12 AM

i read somewhere that if we assume simple uniform hashing model then the cost for a successful "find" or "lookup" operation in a dictionary is Θ(1+c) where c=n/m where n is the no. of elements in the dictionary and m is the no. of slots in the hash table.
Can someone tell me how ?
Is This A Good Question/Topic? 0
  • +

Replies To: simple uniform hashing(SUH)

#2 macosxnerd101  Icon User is online

  • Self-Trained Economist
  • member icon




Reputation: 10446
  • View blog
  • Posts: 38,684
  • Joined: 27-December 08

Re: simple uniform hashing(SUH)

Posted 13 March 2013 - 11:45 AM

Start by reading up on Wikipedia and doing a little research.
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1