Hashing Quest

[bdadbin]

Suppose you want to use hashing with linear probing on a table of size m, and have n keys to place in it, with n<m. In terms of m, what is the largest n can be and still guarentee O(1) average case performance when searching for a key?

a. (3 * m)/4
b. m/2
c. m/4
d. squareRoot(m)

[TheCPUWizard]

Soulds suspicously like a homework/exam question.....

[bdadbin]

you must be a rocket scientist, b/c no one could have figured that one out. impressive.