Add small check to Hashmap_find_bucket.

Check to see that modulus is working properly
Initial compile to exercise 38.

Starting up this textbook again after a very long hiatus. Will go back to the
previous exercise to finish up the extra credit. Still need to read about the
implementation of the hash functions and their reasoning.
Dynamic Array sorting now implemented with freebsd's sorting library.
Entries in a hashmap are now sorted for easier lookup.

Part of exercise 26's extra credit done.
Makefile library flag update to fix clock_gettime missing reference error.

Added -lrt flag to eliminate clock_gettime error flag.
Error most likely arises from a recent linux kernel update.
Implement Hashmap_uniq_set function that adds set insert feature to Hashmaps.

Hashmap_uniq_set checks to see if the same key already exists
within the hash, and does not add to the bucket if it does. Note
that this resolves the ambiguity of having two keys with different
values, as now it always resolves for the older value. Associated
unit tests have also been added to test functionality
Ignore text file output for statistical properties of Hashmap_algos.

Ignore hash.txt