Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

6
  • 2
    ASCII art FTW ! Commented Mar 18, 2011 at 17:44
  • 2
    Great answer. It may be worth mentioning that the method where each index is a linked list is called chaining. Commented Dec 19, 2012 at 21:08
  • +1 Excellent answer , popped out almost every doubts off my head . Need to ask one more question . Do every implementation use hashing to store integers ? or this is used for specific cases ? if yes , then what are those cases ? Commented Aug 7, 2013 at 8:44
  • @PHIfounder I'm not sure if I understood your question completely, but the hash function that is performed on the key is designed to be generic, not just to apply to a specific data type such as integers. If we're talking about C code, the hash table could be designed to accept (void *) for the key and value and do a hash calculation on the key's pointer value. Commented Aug 9, 2013 at 1:32
  • @Jeff actually I may be a fool to ask this , but I am talking about the internal structure of a computer ; whether every computer uses a data structure like hash table to store store refer to integers or not internally ? Commented Aug 9, 2013 at 4:16