View Single Post
Old 03 August 2015, 00:53   #201
Computer Nerd

Thorham's Avatar
Join Date: Sep 2007
Location: Rotterdam/Netherlands
Age: 42
Posts: 3,046
Originally Posted by Mrs Beanbag View Post
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.
Thorham is offline  
AdSense AdSense  
Page generated in 0.04022 seconds with 10 queries