|
-
December 6th, 2004, 08:19 PM
#1
 Hashing Quest
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)
-
December 6th, 2004, 09:26 PM
#2
Re: Hashing Quest
Soulds suspicously like a homework/exam question.....
TheCPUWizard is a registered trademark, all rights reserved. (If this post was helpful, please RATE it!)
 2008, 2009,2010
In theory, there is no difference between theory and practice; in practice there is.
* Join the fight, refuse to respond to posts that contain code outside of [code] ... [/code] tags. See here for instructions 
* How NOT to post a question here 
* Of course you read this carefully before you posted 
* Need homework help? Read this first 
-
December 7th, 2004, 03:50 AM
#3
Re: Hashing Quest
you must be a rocket scientist, b/c no one could have figured that one out. impressive.
Last edited by bdadbin; December 7th, 2004 at 03:54 AM.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|
Reply With Quote
