Hashing in a nutshell: apply hash function f() to the keys, bucket the data records accordingly. Where a radix sort would use part of the key directly (like a hash function that just masks bits), hashing picks a more complicated function. So there's a tradeoff. Your data is no longer sorted by the key, but by f(key). On the other hand, you get a flat distribution that makes the bucketing work.
Can you truly not see the similarity between distribution sort and hashing?
In reply to Re^5: Out of Memory when generating large matrix
by Anonymous Monk
in thread Out of Memory when generating large matrix
by cathyyihao
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |