Timeline for I'm trying to understand hash tables - can someone explain it to me - clearly?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2013 at 4:38 | comment | added | Jeff | @PHI I think I understand what you're asking a little more. Hash tables are a general-use data structure, so it is likely that a lot of operating systems use them internally for storing data, although not necessarily integers themselves. It sounds like you may want to read up more on Operating Systems, Computer Architecture (including Instruction Set Architectures), and maybe the memory layout of a C program. | |
| Aug 9, 2013 at 4:16 | comment | added | 0decimal0 | @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 ? | |
| Aug 9, 2013 at 1:32 | comment | added | Jeff | @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. | |
| Aug 7, 2013 at 8:44 | comment | added | 0decimal0 | +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 ? | |
| Dec 19, 2012 at 21:08 | comment | added | alexn | Great answer. It may be worth mentioning that the method where each index is a linked list is called chaining. | |
| Mar 26, 2011 at 22:54 | vote | accept | Stevo | ||
| Mar 18, 2011 at 17:44 | comment | added | Anto | ASCII art FTW ! | |
| Mar 18, 2011 at 9:57 | history | answered | Jeff | CC BY-SA 2.5 |