Another QuickSort implementation in Golang

quicksort2.go

package main
 
import (
	"fmt"
	"sort"
)

func quickSort(a sort.Interface, left, right int) {
	if left >= right {
		return
	}
	piv := partition(a, left, right, right)
	quickSort(a, left, piv-1)
	quickSort(a, piv+1, right)
}

func partition(a sort.Interface, left int, right int, piv int) int {
	j := left
	for i := left; i <= right; i++ {
		if a.Less(i, piv) {
			a.Swap(i, j)
			j++
		}
	}
	a.Swap(piv, j)
	return j
} 

func main() {
	a := []int{1, 3, 9, 8, 2, 7, 5}
	fmt.Println("unsorted: ", a)

	quickSort(sort.IntSlice(a), 0, len(a)-1)

	fmt.Println("Sorted: ", a)
}