quickSort demo

quickSort.go

func quickSort(strings []string) []string {
	if len(strings) <= 1 {
		return strings
	}

	pivot := strings[0]
	left := []string{}
	right := []string{}

	for i := 1; i < len(strings); i++ {
		currString := strings[i]
		if currString > pivot {
			right = append(right, currString)
		} else {
			left = append(left, currString)
		}
	}

	sortedLeft := quickSort(left)
	sortedRight := quickSort(right)

	sorted := append(sortedLeft, pivot)
	sorted = append(sorted, sortedRight...)

	return sorted
}