Implementation of Quick Sort in Go

quickSort.go

// We will call quicksort with 
// quickSort(array, 0, len(array)-1)

func quickSort(A []int, p int, r int) []int {
	if p < r {
		var q = partition(A, p, r)
		quickSort(A, p, q-1)
		quickSort(A, q+1, r)
	}
	return A
}

func partition(A []int, p int, r int) int {
	var x = A[r]
	var i = p - 1
	for j := p; j < r; j++ {
		if A[j] <= x {
			i = i + 1
			A[i], A[j] = A[j], A[i]
		}
	}
	A[i+1], A[r] = A[r], A[i+1]
	return i + 1
}