I am trying to figure out how to do string hashing with linear probes. Actually, I have done this: A hash table has been created: One Every string has to be from the dictionary (90000 words), and to retrieve the anagrams of the selected words. 2 * 90000 in size Using a simple hash function, I get the word from each word, get a value If that hash table index is empty, check if the value is, otherwise, create a new hash value. Each word is in the hash table, and I execute a search After the hash function, The hash value will be received, and it will be checked whether the value exists in the hash table. If it exists, then it will compare permutations compared to struts. If the match is true, then it will output. If not, then it is using a new hash value. The problem is that the whole process is very slow ... it's fine, but the search takes a long time. How I am out of ideas about how to make it fast .. Thank you for your reading. Put all ...