SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES

Pesquisa Operacional

Lucila Maria De Souza Bento¹  Vinícius Gusmão Pereira De Sá¹  Jayme Luiz Szwarcfiter¹ 

关键词: hash tables;    efficient algorithms;    practical algorithms;    average-time complexity;   

DOI  :  10.1590/0101-7438.2015.035.02.0423

来源: SciELO

【 摘 要 】

Hash tables are among the most important data structures known to mankind. Throughhashing, the address of each stored object is calculated as a function of the object's contents. Because they do not require exorbitant space and, in practice, allow for constant-time dictionary operations (insertion, lookup, deletion), hash tables are often employed in the indexation of large amounts of data. Nevertheless, there are numerous problems of somewhat different nature that can be solved in elegant fashion using hashing, with significant economy of time and space. The purpose of this paper is to reinforce the applicability of such technique in the area of Operations Research and to stimulate further reading, for which adequate references are given. To our knowledge, the proposed solutions to the problems presented herein have never appeared in the literature, and some of the problems are novel themselves.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License