Hashes can sometimes be cached, if there is sufficient room in the data composition where The important thing is saved; caching the result of comparisons (a binary operation) is commonly impractical. Conversely, comparisons can gain from shortcutting: if keys normally differ within the 1st number of bytes, a unfavorable comparison can be very speed