Hashes can sometimes be cached, if there is sufficient home in the info structure where The important thing is saved; caching the result of comparisons (a binary operation) is usually impractical. Alternatively, comparisons can advantage from shortcutting: if keys frequently differ within the first couple bytes, a detrimental comparison can be quit