Penguin
Annotated edit history of HashTable version 2, including all changes. View license author blame.
Rev Author # Line
2 JohnMcPherson 1 An [Algorithm] where you take a [Hash] of a key, and then index it into a lookup table to find the value. You can get HashCollisions when two keys hash to the same value, in that case you peturb your hash and put it somewhere else in the array (which I think is really ugly), or you can have your lookup table being a linked list of (key,value) pairs, which you walk.
1 PerryLorier 2
3 HashTable's have approximately !O(1)[1] lookup with a good [Hash] value.
4
5 [1]: See ComplexityTheory