public void quickSort(int a[],int low,int high)
	{
		int i = low;
		int j = high;
		int mid = low + (high - low)/2;
		
		while(i <= j)
		{
			while(a[i] < a[mid])
			{
				i++;
			}
			while(a[j] > a[mid])
			{
				j--;
			}
			
			if(i <= j)
			{
				int temp = a[i];
				a[i] = a[j];
				a[j] = temp;
				i++;
				j--;
			}
		}
		
		if(low < j)
		{
			quickSort(a,low,j);
		}
		
		if(i < high)
		{
			quickSort(a,i,high);
		}
	}