Quick Find Algorithm

QuickFind.java

public class QuickFind {

    public static void main(String[] args){
        QuickFind pol = new QuickFind(10);

        pol.union(3, 5);
        pol.union(5, 6);
        pol.union(3, 1);
        pol.union(8, 0);
        pol.union(8, 2);
        pol.union(9, 3);

        // check if 5 and 6 are connected
        System.out.println(pol.connected(5,6));
    }


    private int[] id;

    QuickFind(int n) {
        id = new int[n];
        for (int i = 0; i < n; i++)
            id[i] = i;
    }

    void union(int p, int q) {
        int pid = id[p];
        int qid = id[q];
        for (int i = 0; i < id.length; i++)
            if (id[i] == pid)
                id[i] = qid;
    }

    boolean connected(int p, int q) {
        return id[p] == id[q];
    }

    public int[] getResult() {
        return id;
    }

}