算法之线性探查

1. packagecom.eshore.sweetop.dataframe;
3. importcom.eshore.sweetop.data.KeyData;
5. /*
6. *linearprobing
7. *Note:secondarychustering
8. */
9. publicclassLineOpenHashextendsOpenHash{
10. publicLineOpenHash(intsize){
11. super(size);
12. }
14. @Override
15. publicinthash(intk,inti){
16. return(multihash(k)+i)%table.length;
17. }
19. publicintmultihash(intk){
20. doubled=k*0.6180339887;
21. inta=(int)Math.floor(table.length*(d-(newDouble(d).intValue())));
22. returna;
23. }
25. publicstaticvoidmain(String[]args){
26. OpenHashoh=newLineOpenHash(10);
27. oh.insert(newKeyData(1));
28. oh.insert(newKeyData(2));
29. oh.insert(newKeyData(3));
30. oh.insert(newKeyData(14));
31. KeyDatak=oh.search(2);
32. System.out.println(k);
34. }
35. }