Open Addressing Hash Table Collision Search for an Element Deleting of an Element
Issue Date:
2004
Publisher:
Institute of Information Theories and Applications FOI ITHEA
Abstract:
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.