1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
|
import ( "fmt" )
func main() { // fmt.Println("Hello Mac go")
arr := []int{3, 7, 5, 1, 8, 6}
quick_sort(arr, 0, len(arr)-1)
for v := range arr { fmt.Println(arr[v]) } }
func quick_sort(a []int, low int, high int) { i := low j := high base := a[low]
for ; i < j; {
for ; a[j] > base && i < j; { j-- }
if i < j { temp := a[j] a[j] = a[i] a[i] = temp i++
for ; a[i] < base && i < j; { i++ } if i < j { temp2 := a[i] a[i] = a[j] a[j] = temp2 j-- } } }
a[i] = base
if low < i-1 { quick_sort(a, low, i-1) } if j+1 < high { quick_sort(a, j+1, high) } }
|
近期评论