C Program To Implement Dictionary Using Hashing Algorithms ~repack~ -

void dict_rehash(Dictionary *dict, int new_size) Entry **old_buckets = dict->buckets; int old_size = dict->size; dict->buckets = calloc(new_size, sizeof(Entry*)); dict->size = new_size; dict->count = 0;

Instead of using fixed arrays like char key[50] , this program uses dynamic string allocation via strdup() . This saves memory since it allocates exactly the number of bytes required for each unique string. 2. Why the Prime Table Size? c program to implement dictionary using hashing algorithms

// Function to insert a key-value pair into the dictionary void insert(Dictionary* dict, char* key, char* value) int index = hash(key, dict->size); DictionaryEntry* entry = dict->table[index]; Why the Prime Table Size

typedef struct Dict Node **table; // array of linked list heads int size; // capacity of the hash table int count; // number of key-value pairs stored Dict; char* value) int index = hash(key

typedef struct Entry **buckets; int size; HashTable;