Hash functions
Hi I have this exercise from this book and its telling me to
Insert the keys E A S Y Q U T I O N in that order into an initially empty table of M = 5 lists, using separate chaining. Use the hash function 11 k % M to transform the kth letter of the alphabet into a table index.
However, what does it mean by "Use the hash function 11 k % M"
Thank you
Insert the keys E A S Y Q U T I O N in that order into an initially empty table of M = 5 lists, using separate chaining. Use the hash function 11 k % M to transform the kth letter of the alphabet into a table index.
However, what does it mean by "Use the hash function 11 k % M"
Thank you
The hash function is how you take your input -> the key for the table you are putting it in. So when you insert some letter, you should plug it into that function and use that as the key where you insert it.
How am I suppose to actually do that?
Because I am suppose to derive it step by step by hand and not on the computer
Because I am suppose to derive it step by step by hand and not on the computer
Last edited on
Topic archived. No new replies allowed.