You simply start at the beginning ( foo at index 0) and compare each key. If the key matches what you're looking for, you're done. Quick Way to Implement Dictionary in C - Stack Overflow
The heart of a dictionary is the hash function. It takes a "key" (usually a string) and converts it into an integer index. A good hash function distributes keys uniformly across the table to minimize collisions. Collision Handling c program to implement dictionary using hashing algorithms
printf("\n");
Remember: The quality of your hash function directly determines the performance of your dictionary. Always test with your actual key distribution before deployment. You simply start at the beginning ( foo