quicksort.java

	public static void quickSort(int start, int end, int[] a) {
		int pivot = (a[start] + a[end]) / 2;
		int left = start;
		int right = end;
		int temp;
		
		//pivotization
		while (left <= right) {
			while (a[left] < pivot) left++;
			while (a[right] > pivot) right--;
			if (left <= right) {
				temp = a[left];
				a[left] = a[right];
				a[right] = temp;
				left++;
				right--;
			}
		}
		if (start < right) quickSort(start, right, a);
		if (left < end) quickSort(left, end, a);
	}