判断两个集合是否相交（判定问题）

package test;
//判断两个集合是否相交，是否有交集
import Search.QuickSort;
public class Disjoint_Set extends QuickSort {

public int Disjoint_Set(int a[], int b[])
{
	int count = 0;
	int i = 0, j = 0;
	Quicksort(a, 0, a.length - 1);
	Quicksort(b, 0, b.length - 1);
	while (i < a.length && j < b.length)
	{
		if (a[i] < b[j]) {
			i++;
			count++;
		} else if (a[i] > b[j]) {
			j++;
			count++;
		} else
			break;
	}
	return count;
			
}

public static void main(String[] args) {
	int a[] = { 1, 2, 7, 5, 6 };
	int b[] = { 20, 7, 8, 9, 10, 11 };
	
	
	Disjoint_Set ds = new Disjoint_Set();
	
	
	
	int count=ds.Disjoint_Set(a, b);
	
	if ( count ==a.length||count==b.length)
	{
		System.out.println("无交集");
	} else
		System.out.println("有交集");
}

}
时间复杂度分析：
2O(nlg(n))+O(n)=O(nlg(n))