GitHub - jacobmcclure/Dictionary: This is a hash table implementation of the dictionary ADT which handles collisions using chaining. The implementation is essentially an array of linked lists that will append a new node (make it the tail) to the linked list whose head it collided with/ It is a simple, yet useful and relatively fast implementation.

jacobmcclure / Dictionary Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This is a hash table implementation of the dictionary ADT which handles collisions using chaining. The implementation is essentially an array of linked lists that will append a new node (make it the tail) to the linked list whose head it collided with/ It is a simple, yet useful and relatively fast implementation.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Dictionary.c		Dictionary.c
Dictionary.h		Dictionary.h
DictionaryTest.c		DictionaryTest.c
Makefile		Makefile
README		README

Repository files navigation

Jacob McClure
[email protected]

1) README - (this file) a table of contents for the repository

2) Dictionary.c - executable C file for the Dictionary ADT which utilizes
   an array of pointers which all reference the head node of a linked list.
   That is, several linked lists embedded in an array, where the array itself
   contains pointers to the heads of each linked list. Collisions are handled by
   appending the new node as the tail of the linked list whose head it collided
   with.

3) Dictionary.h - header file that contains all of the function prototypes
   for Dictionary.c.

4) DictionaryTest.c - test client for Dictionary.c that checks
   functionality of all functions and structs, etc.

5) Makefile - Tool created to ease the compilation and execution of 
   Dictionary.c. Also contains a memcheck tool to check for memory leaks.