Use hashing for fast search in a large word list !
When run the program should ask for a word list le as input. The le will contain one word per line. The program should add all the words in the list to a hash table. Choose any appropriate hash function, table size and collision resolution strategy. Once all the words have been added to the hash table, the program should ask the user for a word to search. If the word exists in the list, the program should output `word found' and `word not found' otherwise. The program should then prompt the user for the next word to search. Typing `exit' should exit the program. Your program should work with large word lists with, say, a million words.
give me the algorithm of this !