quickSort in Java

QuickSort.java

void quickSort(int[] array, int left, int right){
	int index = partition(array, left, right);
	if(left < index - 1){
		quickSort(array, left, index - 1);
	}
	if(index < right){
		quickSort(array, index, right);
	}
}

int partition(int[] array, int left, int right){
	int pivot = array[(left + right)/2];
	while (left < right) {
		while (array[left] < pivot) left++;
		while(array[right] > pivot) right --;
		if(left <= right){
			int tmp = array[left];
			array[left] = array[right];
			array[right] = tmp;
			left ++;
			right --;
		}
	}
	return left;
}