Originally Posted by Mrs Beanbag
Well, it depends how basic. If it is a fixed size and you can guarantee no collisions, it is very simple. If it can dynamically grow, you have to think about different strategies. And just the hash function can range from simple to complex.
Fixed size with collisions and a simple hash algorithm. In C that's not complex at all, while it's already very effective.