vi

[criacuervos]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	it can improve the efficiency for the lookup of data in your hash table
How can you judge if a hash function is good or not?	if it has minimal collisions, and a low loading factor
Is there a perfect hash function? If so what is it?	no, there will always be some chance of collision
Describe a strategy to handle collisions in a hash table	usually a function will assign the data to the next free location
Describe a situation where a hash table wouldn't be as useful as a binary search tree	if you have the same key for a lot of your data, or order is very important
What is one thing that is more clear to you on hash tables now	i understand a hash functions main purpose, which is putting a key into a given location to make the lookup time constant

[CheezItMan]

Overall nice work, you hit the main learning goals here. Well done. Do take a look at my minor comments. You did have a typo on submission in anagrams. It's helpful to run the code once prior to submission.

[CheezItMan]

Missing an end after the return

Suggested change

	return anagram_hash.valuesend
	return anagram_hash.values
	end

[CheezItMan]

Just note that this iterates k times and each time loops through an hash of n size so this is O(nk)

[CheezItMan]

This works, but take a look at my comments on time complexity.