Question

List in psuedo code how you might implement a hash table

List in psuedo code how you might implement a hash table

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer: HASHINSERT(A,O,H)

Step 1:h<-hash(A.getName())
Step 2:if H.containsKey(h) then
Step 3:B<-H.get(h)
Step 4:H.eraseByKey(h)
Step 5:if isPair(A,B) then
Step 6: O.insert((A,B))
Step 7:else LISTINSERT(L,B,O)
Step 8:H.insert(h,A)
Step 9:else H.insert(h,A)

Add a comment
Know the answer?
Add Answer to:
List in psuedo code how you might implement a hash table
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT