快速排序算法
-
通过递归实现快速排序 (排序过程类似一棵树,二分排序),在所有算法中二分化是最常用的方式,将问题尽量的分成两种情况加以分析, 最终以形成类似树的方式加以利用,因为在比较模型中的算法中,最快的排序时间 负载度为 O(nlgn)
-
package main import ( "fmt" "log" ) func QuickSort(arr []int) []int { if len(arr) <= 1 { return arr } splitData := arr[0] low := make([]int, 0) height := make([]int, 0) mid := make([]int, 0) mid = append(mid, splitData) for i := 1; i < len(arr); i++ { if splitData < arr[i] { low = append(low, arr[i]) } else if splitData > arr[i] { height = append(height, arr[i]) } else { mid = append(mid, arr[i]) } } low, height = QuickSort(low), QuickSort(height) myArr := append(append(low, mid...), height...) log.Printf("low:%v,mid:%v,hight:%v\n", low, mid, height) return myArr } func main() { arr := []int{1, 9, 10, 30, 2, 5, 45, 8, 63, 234, 12} fmt.Println(QuickSort(arr)) } /** 2022/10/18 21:44:00 low:[234],mid:[63],hight:[] 2022/10/18 21:44:00 low:[234 63],mid:[45],hight:[] 2022/10/18 21:44:00 low:[234 63 45],mid:[30],hight:[12] 2022/10/18 21:44:00 low:[234 63 45 30 12],mid:[10],hight:[] 2022/10/18 21:44:00 low:[8],mid:[5],hight:[] 2022/10/18 21:44:00 low:[8 5],mid:[2],hight:[] 2022/10/18 21:44:00 low:[234 63 45 30 12 10],mid:[9],hight:[8 5 2] 2022/10/18 21:44:00 low:[234 63 45 30 12 10 9 8 5 2],mid:[1],hight:[] [234 63 45 30 12 10 9 8 5 2 1] */