Set representation. Hashing
In section 6 we considered several representations for sets whose elements are integers of arbitrary size. However, all those representations are rather inefficient: at least one of the operations (membership test, adding or deleting an element) runs in time proportional to the number of elements in the set. This is unacceptable in almost all practical applications.
KeywordsHash Function Distinct Element English Word Arbitrary Size Correct Word
Unable to display preview. Download preview PDF.