void quickSort(int A[], int start, int end){
		if (end-start <= 0){
			return;
		}
		if (end-start == 1){
			if (A[start] > A[end]){
				int temp = A[start];
				A[start] = A[end];
				A[end] = temp;
			}
		}
		
		
		int i = start, j = end;
		
		int value = A[start];
		A[start] = A[end];
		A[end] = value;
		
		while (true){
			while (i < j){
				if (A[i]<= value){
					++i;
				} else {
					break;
				}
			}
			while (i < j){
				if (A[j-1] > value){
					--j;
				} else {
					break;
				}
			}
			if (i == j){
				break;
			} else{
				int temp = A[i];
				A[i] = A[j-1];
				A[j-1] = temp;
			}
		}
		int temp = A[i];
		A[i] = A[end];
		A[end] = temp;
		
		
		quickSort(A, start, i-1);
		quickSort(A, i+1, end);
	}