Leah - Space

[leahwho]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	If you use a bad hash function, you'll get overlapping keys or all your data will be in a cluster.
How can you judge if a hash function is good or not?	If it consistently gives you unique keys and your data is spread out across the structure
Is there a perfect hash function? If so what is it?	I don't think so.
Describe a strategy to handle collisions in a hash table	If you get a collision, you can do linear or quadratic probing, which means you move whatever you're storing to a new space in your structure.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	If you can't be mostly certain you'll get unique keys, a BST is probably a better option.
What is one thing that is more clear to you on hash tables now	I understand how hashes work under the hood in Ruby! This is SO COOL.

[CheezItMan]

Nice work, see my few notes Leah, but otherwise you did well here.

[CheezItMan]

👍

[CheezItMan]

👍 , nice work, however you're already sorting the list, which would be O(n log n)