implement a hash table using array version of chaining. Complete code please. So

Question

implement a hash table using array version of chaining. Complete code please.

Explanation / Answer

#include #include #include #define TABSIZ 200 struct TabRec { struct TabRec *next; char name[BUFSIZ]; }; static struct TabRec *htable[TABSIZ]; unsigned hash(char *s) { unsigned h; for (h = 0; *s; s++) h = *s + 31 * h; return h % TABSIZ; } struct TabRec *find(char *name) { struct TabRec *item; for (item = htable[hash(name)]; item; item = item->next) { if (strcmp(name, item->name) == 0) return item; } return NULL; } struct TabRec *insert(char *name) { struct TabRec *item; unsigned h; if ((item = find(name)) == NULL) { /* Not found, add */ if ((item = malloc(sizeof (*item))) == NULL) return NULL; strcpy(item->name, name); h = hash(name); item->next = htable[h]; htable[h] = item; } return item; } int main(void) { char buf[BUFSIZ]; struct TabRec *item; while (fgets(buf, sizeof (buf), stdin)) { if (insert(buf) == NULL) break; } printf("Enter a name to find: "); fflush(stdout); if (fgets(buf, sizeof (buf), stdin)) { if ((item = find(buf)) != NULL) printf("%s", item->name); } return 0; }

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.