Quicksort algorithm in GO

qsort.go

package main

import "fmt"

func quicksort(slice []int) ([]int) {
	length := len(slice)

	// The array is considered sorted if it contains only one element.
	if length < 2 {
		return slice
	}

	// Picking a pivot.
	pivot := slice[0]

	// Partitioning the array into sub-arrays.
	var left []int
	var right []int

	for _, v := range slice[1:] {
		if v <= pivot {
			left = append(left, v)
		}
	}

	for _, v := range slice[1:] {
		if v > pivot {
			right = append(right, v)
		}
	}

	right = quicksort(right)
	left = quicksort(left)

	// Concatenating left, pivot and right.
	left = append(left, pivot)
	left = append(left, right...)

	return left
}

func main() {
	var slice = []int{12, 1, 44, 5, 96}
	fmt.Println(slice)

	slice = quicksort(slice)

	fmt.Println(slice)
}