public void quickSort(int left, int right, int[] arry) {
		int i,j,tmp, pivot;
		
		if (left < right) {
			i = left;
			j = right;
			pivot = arry[left];
			
			while (i < j) {
				while (arry[j] > pivot) j--;
				while (i < j && arry[i] <= pivot) i++;
				tmp = arry[i];
				arry[i] = arry[j];
				arry[j] = tmp;
			}
			arry[left] = arry[i];
			arry[i] = pivot;
			quickSort(left,	i-1, arry);
			quickSort(i+1, right, arry);
		}
	}