Realization of Open Addressing Hash Table in the Chained Allocated Memory
| Data(s) |
28/12/2009
28/12/2009
2004
|
|---|---|
| Resumo |
In this article, we examine a realization of an open addressing hash table in the chained allocated memory, giving us the opportunity to decrease the number of linear probing when a given element has not been inserted in the table. |
| Identificador |
1313-0463 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #Open Addressing Hash Table #Collision #Search for an Element #Deleting of an Element |
| Tipo |
Article |
