Hashes can sometimes be cached, if there is ample space in the information structure where The important thing is stored; caching the results of comparisons (a binary operation) is often impractical. Then again, comparisons can reward from shortcutting: if keys often vary within the first severa