calculate and store possible positions for the key . * check if key already present at any of the positions . If YES , return .
for ( int i = 0 ; i < ver ; i ++ ) { pos [ i ] = hash ( i + 1 , key ) ; if ( hashtable [ i ] [ pos [ i ] ] == key ) return ; }