I've always thought hash tables were incredible data structures. While they have their own shortcomings, they still eliminate a lot of the problems faced by other data structures. The fact that they can be used in constant time is neat, and in some ways makes them ideal.
I've studied hashing before, and found them pretty straightforward. It has been a few years since addressing them in a class, and we didn't delve much into the mathematics behind them, so this will be a nice refresher and stepping stone. I noticed that while collisions were mentioned conceptually in the text, there weren't many details about collision handling at all, which I found unfortunate, because there are many neat ways of addressing them.
No comments:
Post a Comment