Simple QuickSort implementation in Golang #1

quicksort1.go

package main
 
import (
	"fmt"
	"sort"
)

func quicksort(a sort.Interface, i, j int) {
	if j > i { 	
		left, right := i, j
		piv := j
		for left <= right {
			for ;a.Less(left, piv); left++ {}
			for ;a.Less(piv, right); right-- {}
			if left <= right {
				a.Swap(left, right)
				left++
				right--
			}
		}
		quicksort(a, i, right)
		quicksort(a, left, 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)
}