Direct-Address Tables

U = { 0, 1, ..., m-1 } is the universe of possible keys. If m is not too large ( m = |U| ). Assume no two elements have the same key:

O (1) Direct-Address-Search ( T, k ), returns T[k]

O (1) Direct-Address-Insert ( T, x ),  T[key[x]] ¬ x

Direct-Address-Delete ( T, x ) ,  T[key[x]] ¬ nil