Hashes can sometimes be cached, if there is plenty of place in the information structure where The important thing is stored; caching the results of comparisons (a binary operation) is usually impractical. Conversely, comparisons can reward from shortcutting: if keys usually differ within the very first handful of bytes, a adverse comparison can be