next up previous
Next: Operations Up: CSE 2320: Algorithms and Previous: Better Solution

Direct-Address Tables

If the number of possible keys is and they are , then the table can be a BIG array.

Let the universe of m possible keys be U = {0, 1, .., m-1}.

Direct-Address Table T[0,..,m-1] is an array. Each slot (array element) corresponds to a unique key.


Copyright © 1998 The University of Texas at Arlington