用Go实现快速排序

这个感觉写的不太好，欢迎提出指正，对Go的语法还不是特别熟

package main

import "fmt"

func quicksort(arr []int)  []int{
	less := []int{}
	greate := []int{}
	if len(arr) < 2{
		return arr
	}else {
		pivot := arr[0]
		for _,v := range arr[1:]{
			if v <= pivot{
				less = append(less,v)
			}else{
				greate = append(greate,v)
			}
		}
		less = append(quicksort(less),pivot)

	}
	slice := append(less,quicksort(greate)...)
	return slice
}
func main()  {
	fmt.Println(quicksort([]int{2,45,1,4,6,23,12,45,4,9,1,5,9,1234,65}))
}