Fire - Gessica Mohr

[GeMath18]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Because Hash Functions are good for lookups and gives a better time complexity.
How can you judge if a hash function is good or not?	A good hash function must be consistent, should (mostly) map different keys to different values, should execute in constant time, and the hashing should appear to be random.
Is there a perfect hash function? If so what is it?	No, there is not a perfect hash function.
Describe a strategy to handle collisions in a hash table	Quadratic probing is that when inserting an element, if the bucket is full, instead of incrementally searching the array for an empty bucket, a formula is applied to search.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Hash table would not be useful if the data needs to be sorted.
What is one thing that is more clear to you on hash tables now	Learned on ways how to handle collisions.

[CheezItMan]

Nice work Gessica, you hit all the learning goals here. Well done!

[CheezItMan]

👍 However since you're sorting the words, the time complexity is O(n + m log m) where m is the length of the words. If you assume the words are limited in size, then it would be O(n).

[CheezItMan]

👍