next up previous
Next: Pseudocode Up: CSE 2320: Algorithms and Previous: Open Addressing

Pseudocode

   Insert(T,k)
      i = 0
      repeat
         j = h(k,i)
         if T[j] = NIL
         then T[j] = k
              return j
         else i = i + 1
      until i = m
      error "hash table overflow"



Copyright © 1998 The University of Texas at Arlington