Alie Ibarra C16

[alieibarra]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Good hash functions avoid collision
How can you judge if a hash function is good or not?	A hash function is "good" is it is consistent, maps different keys to different values, executes constant time, and appears to be random.
Is there a perfect hash function? If so what is it?	There is no perfect hash function
Describe a strategy to handle collisions in a hash table	Utilizing linear probing can help to avoid collision
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Binary search tree would be more useful when wanting to construct ordered data
What is one thing that is more clear to you on hash tables now	A has table will more than likely have an O(1) time complexity, with O(n) in a worst case scenario situation

[chimerror]

Grabbing this to grade!

[chimerror]

Good work!

I left a correction for your time complexity calculation for the top k most frequent elements, but otherwise this looks good enough for a Green!

[chimerror]

Don't forget to account for the call to sorted in line 32, which will take O(n * log(n)) time, and thus be the dominant part, and the correct time complexity.