![]() We’re going to take a quick look at linear and binary search, and then learn how to write our own hash table. There are many things you can do when you realize this: use linear search, use binary search, grab someone else’s hash table implementation, or write your own hash table. Recently I wrote an article that compared a simple program that counts word frequencies across various languages, and one of the things that came up was how C doesn’t have a hash table data structure in its standard library. Go to: Linear search | Binary search | Hash tables | Implementation | Discussion My goal is to show that hash table internals are not scary, but – within certain constraints – are easy enough to build from scratch. I briefly demonstrate linear and binary search, and then design and implement a hash table. Summary: An explanation of how to implement a simple hash table data structure using the C programming language.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
June 2023
Categories |