Skip to content

Conversation

@RachaelGomez
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? because if your hash function isn't good you'll have many collisions
How can you judge if a hash function is good or not? It should be as random as you can make it and not have many collisions while still being efficient
Is there a perfect hash function? If so what is it? No I don't believe so.
Describe a strategy to handle collisions in a hash table You can chain the collided elements so they're like that monkeys in a barrel toy, but then you have to sort through them to find the element you want.
Describe a situation where a hash table wouldn't be as useful as a binary search tree any time you're doing a lot of searching rather than just storing data
What is one thing that is more clear to you on hash tables now the concept of bucketing

@RachaelGomez RachaelGomez changed the title cannot pass last test Rachael ---Waterrrrr Jul 17, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant