Help....I'm hoping someone can do a better job explaining 'hashing - linear probing' than this book I'm reading. I'm just looking for the explaination, not any code. I'm trying to insert 'EASYQUTION' into an initally empty hash table witha size of M = 16. I'm using the hash function 11k mod M to transform the kth letter into a table index. If anyone can explain the process or send me a link it would be greatly appreciated.