java数据结构和算法------哈希查找

package iYou.neugle.search;

public class Hash_search {
    private static int m = 13;
    private static int[] hash = new int[m];
    private static int[] array = new int[] { 13, 25, 2, 60, 39, 52 };

    public static void main(String[] args) {
        InsertHash();
        System.out.println("哈希表建立如下:");
        System.out.print("[");
        for (int i = 0; i < hash.length; i++) {
            System.out.print(hash[i]);
            if (i != hash.length - 1) {
                System.out.print(",");
            }
        }
        System.out.println("]");
        System.out.println("39在哈希表中的位置为:" + SearchHash(39));
    }

    public static void InsertHash() {
        // 除法取余法
        for (int i = 0; i < array.length; i++) {
            int value = array[i];
            int address = value % m;
            while (hash[address] != 0) {
                address = (++address) % m;
            }
            hash[address] = value;
        }
    }

    public static int SearchHash(int key) {
        // 开放地址法
        int address = key % m;
        while (hash[address] != 0 && hash[address] != key) {
            address = (++address) % m;
        }

        if (hash[address] == 0) {
            return -1;
        }
        return address;
    }
}