u013248706的博客

/// 快速排序func Sort(a []int, lo, hi int) { if hi <= lo { return } j := Partion(a, lo, hi) Sort(a, lo, j-1 ) Sort(a, j+1, hi)}func Partion(a []int, lo, hi int) int { v := a[lo] i := lo j := hi //array := []int{7,1,100, 88,3,2,8,9,4,5,6} for