C16 - Afina Walton

[afinawalton]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	It can reduce the number of collisions; you can reliably get the same value from the same key.
How can you judge if a hash function is good or not?	If it reduces the number of collisions and there is a random element to the hashing, making it difficult to unscramble.
Is there a perfect hash function? If so what is it?	Nope. Collisions happen inevitably.
Describe a strategy to handle collisions in a hash table	Chaining, in which each bucket contains the head of a linked list, so that multiple elements exist in different places in memory.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	If we wanted to iterate through the hash table, it would take more time than a BST.
What is one thing that is more clear to you on hash tables now	That they are built on top of arrays.

[kyra-patton]

🤠 Nice work Afina. I left some comments on time and space complexity, but otherwise looks good. Answers to the comprehension questions are also solid.

🟢

[kyra-patton]

✨If you want to include sorting the strings in your time complexity, we could say that the time complexity is O(n m log(m)) where m is the length of the string you are sorting and n is the length of strings

Space complexity would also be O(n) where counter and grouped are each of size n

[kyra-patton]

✨ Nice! Since you are sorting the array, it would be O(n log n) time complexity