Jump to content

Talk:Tabulation hashing

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Martinalex000 (talk | contribs) at 10:26, 18 January 2017. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer science B‑class Mid‑importance
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
BThis article has been rated as B-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

Algorithm description rather cryptic

It would be easier to understand the hashing algorithm, if there would be an introduction to all those numbers used (what is t?), then give the algorithm and finally write something about it like the details of how r can control the space-computation tradeoff. Alternatively a simple example like hashing an integet byte-wise using tabular hashing would improve readability a lot.

Martinalex000 (talk) 10:25, 18 January 2017 (UTC)[reply]