Hashing Basics: CS 306 Lecture notes

Computer Algorithms II Lecture Notes

16 September 2008 • Hashing Basics


Arrays may incur overhead if the values being stored have storage-address alignment requirements and the size of the values are not a multiple of the alignment requirement. For example, a five-byte value may have to be double-word aligned (that is, begin on an address divisible by eight), which means an array of these values will have three unused bytes between successive values.


This page last modified on 24 January 2006.