about summary refs log tree commit diff
path: root/scratch/facebook/moderate/find-pairs-for-sum.py
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-11-16T00·35+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-11-16T00·35+0000
commit30f4d6f4a40bfae6bc15332a4e614d40d71fedb4 (patch)
tree46c871c0b8ff038e2fa866a8efed8dfb64fc7f52 /scratch/facebook/moderate/find-pairs-for-sum.py
parent363519273a0e2e7f3e6d63e8d2017b25f480eac9 (diff)
Implement a simple hash function and hash table
I was always curious how hashing functions were implemented, so I read about the
"polynomial rolling hash function", and I decided implementing it would be a
good exercise. After writing that, writing a hash table was simple.
Diffstat (limited to 'scratch/facebook/moderate/find-pairs-for-sum.py')
0 files changed, 0 insertions, 0 deletions