Advertisement
Guest User

Untitled

a guest
Jun 28th, 2017
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.35 KB | None | 0 0
  1. OpenAddressHashDelete(Table T, Key k){
  2.         int i =  Search (T, key);
  3.         if (i ==0)
  4.             return;
  5.         int temp = i;
  6.        
  7.         while( true){
  8.             T[i] = NULL;
  9.             do{
  10.             j = (j+1) % T.size;
  11.             if(T[j] == NULL)
  12.                 return;
  13.             int k = hash(T[j].key)
  14.             }while( if(i<=j)
  15.                     (i<k) && (k<=j)
  16.                 else
  17.                     (i<k) || (k<=j) )
  18.             T[i] = T[j];
  19.             i = j;
  20.         }
  21.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement