File size: 979 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 |
public class Double{
static int max = 10;
static int hash1(int key){
return key%max;
}
static int hash2(int key){
int r = 7; // get prime number
return (r - (key%r));
}
static int probe(int H[], int key){
int index = hash1(key);
int ind = hash2(key);
int i=0;
while(H[(index+i*(ind))%max]!=0){
i++;
}
return (index+i*(ind))%max;
}
static void insert(int H[], int key){
int index = hash1(key);
while(H[index]!=0){
index = probe(H,key);
}
H[index] = key;
}
static int search(int H[], int key){
int i = 0;
int index = hash1(key);
int ind = hash2(key);
while(H[(index+i*(ind))%max]!=key){
i++;
}
return (index+i*(ind))%max;
}
public static void main(String[] args){
int H[] = new int[max];
for(int i=0;i<max; ++i){
H[i] = 0;
}
insert(H,3);
insert(H,5);
insert(H,25);
System.out.println(search(H,25));
}
}
|