快速排序（Quicksort） Golang實現

廢話不多說，直接上代碼：

func sortArray(nums []int) []int {
    return quicksort(nums , 0 , len(nums) - 1)
}

func quicksort(nums []int , low int , high int) []int{
    if low >= high{
        return nums
    }
    pivot := nums[low]
    start := low
    end := high
    for low < high{
        for low < high && nums[high] >= pivot{
            high--
        }
        if low < high{
            nums[low] = nums[high]
            low++
        }
        for low < high && nums[low] < pivot{
            low++
        }
        if low < high{
            nums[high] = nums[low]
            high--
        }
    }
    nums[low] = pivot
    quicksort(nums , start , low - 1)
    quicksort(nums , low + 1 , end)
    return nums
}