Earth - Emily

[emirry]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	A good hash function is important to be able to convert any key to a number. If it's done right, it can scale well and mostly map out keys to different values quickly.
How can you judge if a hash function is good or not?	You can judge if a hash function is good if it can execute in constant time, if it's consistent, and if it can cause fewer collisions.
Is there a perfect hash function? If so what is it?	No? Hashing functions are known as heuristics.
Describe a strategy to handle collisions in a hash table	One strategy is linear probing. Linear probing is a way to handle collisions by searching through the array to place the element in the next available bucket.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Finding the min and max of something..
What is one thing that is more clear to you on hash tables now	I feel like I understand hash functions a little better. I didn't really understand how keys were placed in the array when we first learned about hash tables.

[CheezItMan]

Nice work Emily, you hit the learning goals here. Well done.

[CheezItMan]

Since you are sorting the solution is O(n * m log m) where n is the length of the list and m is the biggest number of characters in the individual strings.

[CheezItMan]

👍 Well done!