3 ms·
And depending on your use case, you may not need to implement growing the hash table, or deletions, making it even simpler/less daunting to implement in C (sinc
by selimnairb 6y ago
And depending on your use case, you may not need to implement growing the hash table, or deletions, making it even simpler/less daunting to implement in C (since this avoids a lot of the memory management parts of the job).
- benhoyt 6y agoYeah, good point. And then you can allocate the hash table struct and all your buckets in one call to malloc().