Alice B. - Earth

[aliceboone]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Its a data structure used to get the data we need in a faster way.
How can you judge if a hash function is good or not?	It can be highly efficient and distribute the keys uniformly
Is there a perfect hash function? If so what is it?	Where that has no collisions
Describe a strategy to handle collisions in a hash table	One strategy is using separate chaining
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Balanced BST would be preferred because of their lower computing cost when a table needs resizing
What is one thing that is more clear to you on hash tables now	There is a lot of options to solve collision.

[CheezItMan]

Nice work Alice, you hit the main learning goals. I did have some comments on time complexity. Let me know if you have any questions regarding it.

[CheezItMan]

👍 The time complexity is O(n) if the strings are limited in size, if they're not because you're sorting the time complexity is O(m * n log n), where m is the number of strings and n is the length of the strings.

[CheezItMan]

👍 However, because you're sorting the time complexity is O(n log n)