Answers are grounded in this paper and cite their sources.
Some variants of the traditional hash method, making use of the numerical or alphabetical order of the keys, lead to faster searching at the expense of a little extra work when items are inserted. The paper presents the new algorithms and analyzes their average running time. (Author)
No takes yet. Share an insight, caveat, or question.
O. Amble (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: