Arcila Maple C16

[arcila13]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	you can prevent too many collisions
How can you judge if a hash function is good or not?	if it avoids as many collisions as possible
Is there a perfect hash function? If so what is it?	No
Describe a strategy to handle collisions in a hash table	Chaining: each element of a hash table's internal array serves as the head of a linked list. This allows the same bucket to store multiple items.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	if you need to insert or update data
What is one thing that is more clear to you on hash tables now	Collisions, why they occur and how to handle them.

[chimerror]

Grabbing this to grade!

[chimerror]

Good work!

I added some comments about extraneous comments and your time complexity calculation for the Top-K problem, but otherwise this looks good enough for a Green.

[chimerror]

As a style thing, you'll usually want to remove comments like this that are not really related to explaining why the code is designed a certain way.

[chimerror]

Same as above, you can probably remove comments like these after they've helped you write your code.

[chimerror]

Don't forget to account for the call to sorted, which takes O(n * log(n)) time, and thus dominates the O(n) part of this algorithm giving a final time complexity of O(n * log(n)).