func sortArray(nums []int) []int {
    if len(nums) <= 1 {
        return nums
    }
    partA := sortArray(nums[:len(nums)/2])
    partB := sortArray(nums[len(nums)/2:])
    
    temp := make([]int, len(partA) + len(partB))

    aPointer := 0
    bPointer := 0
    i := 0
    
    for aPointer < len(partA) && bPointer < len(partB) {
        if partA[aPointer] < partB[bPointer] {
            temp[i] = partA[aPointer]
            aPointer++
        } else {
            temp[i] = partB[bPointer]
            bPointer++
        }
        i++
    }
    for aPointer < len(partA) {
        temp[i] = partA[aPointer]
        aPointer++
        i++
    }
    for bPointer < len(partB) {
        temp[i] = partB[bPointer]
        bPointer++
        i++
    }
    return temp
}

func sortArray(nums []int) []int {
    quickSort(nums)
    return nums
}

func quickSort(nums []int) {
    left, right := 0, len(nums) - 1
    for right > left {
        // 右邊部分放大于
        if nums[right] > nums[0] {
            right--
            continue
        }
        // 左邊部分放小于等于
        if nums[left] <= nums[0] {
            left++
            continue
        }
        nums[left], nums[right] = nums[right], nums[left]
    }
    nums[0], nums[right] = nums[right], nums[0]
    if len(nums[:right]) > 1 {
        sortArray(nums[:right])
    }
    if len(nums[right + 1:]) > 1 {
        sortArray(nums[right + 1:])
    }
}

func sortArray(nums []int) []int {
    // 從n/2  最后一個(gè)非葉子結(jié)點(diǎn)起開(kāi)始構(gòu)建大頂堆
    for i := len(nums) / 2; i >= 0; i-- {
        heapSort(nums, i)
    }

    end := len(nums) - 1
    // 每次將大頂堆的最大值與末尾進(jìn)行交換，并再次排序
    for end > 0 {
        nums[0], nums[end] = nums[end], nums[0]
        heapSort(nums[:end], 0)
        end--
    }
    return nums


}


// 對(duì)一個(gè)非葉子結(jié)點(diǎn)進(jìn)行排序
func heapSort(nums []int,  pos int) {
    end := len(nums) - 1
    left := 2 * pos + 1

    if left > end {
        return
    }

    right := 2 * pos + 2
    temp := left

    // 先左右子結(jié)點(diǎn)進(jìn)行比較，找出較小的那一個(gè)
    if right <= end && nums[right] > nums[temp] {
        temp = right
    }

    if nums[temp] <= nums[pos] {
        return
    }

    nums[temp], nums[pos] = nums[pos], nums[temp]

    // 如果發(fā)生了交換的話 就要繼續(xù)調(diào)查后續(xù)子節(jié)點(diǎn)(只調(diào)查交換了的后續(xù)，不用全調(diào)查，不然會(huì)超時(shí))
    heapSort(nums, temp)
}

func sortArray(nums []int) []int {
    sort.Ints(nums)
    return nums
}