Quick Find Algorithm Java Implementation

Quick Find Algorithm

public class quickFind {

	private int [] id;
	
	public void QuickFindUF (int N){
		id = new int [N];
		for(int i = 0; i< N; i++){
			id[i]=i;
		}
	}
	public boolean connected(int p, int q){
		return id[p] == id[q];
	}
	
	public 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;
			}
		}
	}
}

i need more clear example

Why did you set a new variable qid in union method? You can use id[q] inside for loop instead of qid. The result will not change.

There you have an amazing implementation of QuickFind Algorithm from the Algorithms Course at Princeton University.

Thank you!