FIND and BIND people with exact first names together
The program is designed to process a text file containing people's full names. It utilizes a Red-Black Tree (RBTree) data structure to store people's full names, where the key is the hash value of their first names.
In addition, it incorporates the STAILQ data structure from the "queue.h" header file as the implementation of the queue. This allows the program to efficiently store and manage the full names of duplicates by attaching them to the corresponding tree node where the duplicate first name was found.
- xxHash - hashing algorithm
- /usr/src/sys/sys/tree.h [FreeBSD source]
- /usr/src/sys/sys/queue.h [FreeBSD source]
Create an executable by compiling the main.c file
gcc -o cNameBinder main.c xxHash/xxhash.c
Execute the program by providing the name of your text file as an input
./cNameBinder people.txt