快速排序

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    split_data = arr[0]
    low = []
    high = []
    mid = []
    ret = []
    for i in range(len(arr)):
        if arr[i] < split_data:
            low.append(arr[i])
        elif arr[i] > split_data:
            high.append(arr[i])
        else:
            mid.append(arr[i])
    low, high = quick_sort(low), quick_sort(high)
    ret.extend(low)
    ret.extend(mid)
    ret.extend(high)
    return ret


if __name__ == '__main__':
    print(quick_sort([1, 50, 9, 10, 30, 8, 5, 45, 2, 63, 234, 12]))

package sort

import "fmt"

func QuickSort(arr []int) []int {
    if len(arr) <= 1 {
        return arr
    }
    splitdata := arr[0]          
    low := make([]int, 0, 0)     
    hight := make([]int, 0, 0)   
    mid := make([]int, 0, 0)     
    mid = append(mid, splitdata) 
    for i := 1; i < len(arr); i++ {
        if arr[i] < splitdata {
            low = append(low, arr[i])
        } else if arr[i] > splitdata {
            hight = append(hight, arr[i])
        } else {
            mid = append(mid, arr[i])
        }
    }
    low, hight = QuickSort(low), QuickSort(hight)
    myarr := append(append(low, mid...), hight...)
    return myarr
}

//快读排序算法
func main() {
    arr := []int{1, 9, 10, 30, 2, 5, 45, 8, 63, 234, 12}
    fmt.Println(QuickSort(arr))
}