hash table

a hash table, is an abstract data type that maps keys to values. a hash table uses a hash function to compute an index into an array of buckets or slots, from which the desired value can be found. during lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored.
it contains the following functions:
  • Insert(A, x)
  • Delete(A, x)
  • Search(A, x)