Store Words in a Hash Table. Also, search a word in that Hash Table<\/p>\n\n\n\n
\/\/#define MaxNumbers 100<\/p>\n\n\n\n
\/\/ to divide with<\/p>\n\n\n\n
char hashTable[STORAGESIZE][MaxWordLen];<\/p>\n\n\n\n
\/\/initialize hash table
void initializeHashTable() {
for (int counter = 0; counter < STORAGESIZE; counter++) {
strcpy(hashTable[counter], “”);
}
}<\/p>\n\n\n\n
\/\/ from Noel Kalicharan
\/\/ Advanced topics in C
int convertWordToNumber(char wordToInsert[]) {
\/*
intj, wordNum = 0;
intweight = 3;
while (word[j] != ‘\\0’) {
wordNum += weight * word[j++];
weight += 2;
}
location = wordNum % n + 1;<\/p>\n\n\n\n
return location;\n\n*\/\n\nint j = 0, wordNum = 0;\nint weight = 3; \n\nwhile (wordToInsert[j] != '\\0') {\n wordNum += weight * wordToInsert[j++];\n weight += 2;\n}\n\nreturn wordNum;<\/code><\/pre>\n\n\n\n}<\/p>\n\n\n\n
\/\/find next position after a collission
int findSearchedWordPosition(int hashSearchPosition, char l_wordToSearch[]) {<\/p>\n\n\n\n
int pos;\nfor (pos = hashSearchPosition + 1; pos < STORAGESIZE; pos++) {\n \/\/if (hashTable[pos] == numberToFind) {\n if (hashTable[pos] && strcmp(hashTable[pos], l_wordToSearch) == 0) {\n printf(\"%s %s %d\", l_wordToSearch, \" Found at \", pos);\n return pos;\n }\n}\n\nif (pos >= STORAGESIZE) {\n for (int pos = 0; pos < hashSearchPosition; pos++) {\n if (hashTable[pos] && strcmp(hashTable[pos], l_wordToSearch) == 0) {\n printf(\"%s %s %d\", l_wordToSearch, \" Found at \", pos);\n return pos;\n\n }\n }\n}\n\n\nreturn -1;<\/code><\/pre>\n\n\n\n}<\/p>\n\n\n\n
\/\/find a number and return found\/not-found
int searchHashTable(char l_wordToSearch[]) {<\/p>\n\n\n\n
int numberForTheWord = convertWordToNumber(l_wordToSearch);\nint hashSearchPosition = numberForTheWord % N + 1;\n\nif ( hashTable[hashSearchPosition] && (strcmp(hashTable[hashSearchPosition], l_wordToSearch) == 0) ) {\n printf(\"%s %s %d\", l_wordToSearch, \" Found at \", hashSearchPosition);\n return 1;\n}\nelse {\n\n int wordFoundPosition = findSearchedWordPosition(hashSearchPosition, l_wordToSearch);\n if (wordFoundPosition > 0) {\n printf(\"%s %s %d\", l_wordToSearch, \" Found at \", wordFoundPosition);\n return 1;\n }\n\n\n\n}\n\nprintf(\"Word Not Found\");\nreturn -1;<\/code><\/pre>\n\n\n\n}<\/p>\n\n\n\n
\/\/find next position after a collission
int findNextAvailablePosition(int index) {<\/p>\n\n\n\n
int pos;\nfor (pos = index + 1; pos < STORAGESIZE; pos++ ) {\n \/\/if (hashTable[pos] == 0) {\n if (strcmp(hashTable[pos], \"\") == 0){\n return pos;\n }\n}\n\nif (pos >= STORAGESIZE) {\n for (int pos = 0; pos < index; pos++) {\n \/\/if (hashTable[pos] == 0) {\n if (strcmp(hashTable[pos], \"\") == 0) {\n return pos;\n }\n }\n}\n\n\nreturn -1;<\/code><\/pre>\n\n\n\n}<\/p>\n\n\n\n
\/\/insert data into hash table
int insertToHashTable(int l_position_to_insert, char wordToInsert[]) {<\/p>\n\n\n\n
\/\/find position to insert\n\/\/remainder\nint hashPosition = l_position_to_insert % N + 1;\n\nchar word[MaxWordLen];\n\/\/strcpy(word, hashTable[hashPosition]);\n\nif ( strcmp(hashTable[hashPosition], \"\") != 0) {\n \/\/collision\n \/\/so find the next position\n hashPosition = findNextAvailablePosition(hashPosition);\n}\n\n\/\/error finding a position \nif ((hashPosition > STORAGESIZE) || ((hashPosition == -1))) {\n \/\/ indicates error\n printf(\"\\n%s %s\\n\", \"Did not find a Position for \", wordToInsert);\n return -1;\n}\n\nstrcpy(hashTable[hashPosition], wordToInsert);\n\n\/\/ 1 indicates success\nreturn 1;<\/code><\/pre>\n\n\n\n}<\/p>\n\n\n\n
\/\/flow of the work
int main() {<\/p>\n\n\n\n
\/\/initialize\ninitializeHashTable();\n\n\/\/read data from file\nFILE *in = fopen(\"input.txt\", \"r\");\n\nchar wordToInsert[MaxWordLen];\n\n\n\/\/insertion\n\/\/insert data into the hash table\nwhile (fscanf(in, \"%s\", &wordToInsert) == 1) {\n int positionToInsert = convertWordToNumber(wordToInsert);\n insertToHashTable(positionToInsert, wordToInsert);\n}\n\n\/\/take input from user to search\n\/\/int numberToSearch;\nchar wordToSearch[MaxWordLen];\nprintf(\"\\nPlease type the word to search\\n\");\nscanf(\"%s\", wordToSearch);\n\n\/\/find the number in the hash\nsearchHashTable(wordToSearch);<\/code><\/pre>\n\n\n\n}<\/p>\n","protected":false},"excerpt":{"rendered":"
Store Words in a Hash Table. Also, search a word in that Hash Table define _CRT_SECURE_NO_WARNINGS include include include \/\/#define MaxNumbers 100 define MaxWordLen 50 define Empty 0 define STORAGESIZE 15 \/\/ to divide with define N 15 char hashTable[STORAGESIZE][MaxWordLen]; \/\/initialize hash tablevoid initializeHashTable() {for (int counter = 0; counter < STORAGESIZE; counter++) {strcpy(hashTable[counter], “”);}} … <\/p>\n