Talk:Tabulation hashing
Latest comment: 7 years ago by Martinalex000 in topic Algorithm description rather cryptic
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Algorithm description rather cryptic edit
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)