quick.go

func quickSort(ar []int) []int{

	pivot := ar[rand.Intn(len(ar))]


	less := []int{}
	equal := []int{}
	more := []int{}

	for i := range ar {
		if pivot < i {
			less = append(less, i)
		}

		if pivot == i {
			equal = append(equal, i)
		}

		if pivot > i {
			more = append(more , i)
		}
	}
	
	
	less = quickSort(less)
	more = quickSort(more)
	
	less = append(less, equal...)
	less = append(less, more...)
	
	return less
}