逍遥阁

go语言快速排序

关键词: golang

go语言快速排序

```
package main

import (
    "fmt"
)

func quickSort1(values []int, left, right int) {
    temp := values[left]
    p := left
    i, j := left, right
    for i <= j {
        for j >= p && values[j] >= temp {
            j--
        }
        if j >= p {
            values[p] = values[j]
            p = j
        }
        for i <= p && values[i] <= temp {
            i++
        }
        if i <= p {
            values[p] = values[i]
            p = i
        }
    }
    values[p] = temp
    if p-left > 1 {
        quickSort1(values, left, p-1)
    }
    if right-p > 1 {
        quickSort1(values, p+1, right)
    }
}

func quickSort2(values []int, start, end int) {
    i, j := start, end
    key := values[(start+end)/2]
    for i <= j {
        for values[i] < key {
            i++
        }
        for values[j] > key {
            j--
        }
        if i <= j {
            values[i], values[j] = values[j], values[i]
            i++
            j--
        }
    }
    if start < j {
        quickSort2(values, start, j)
    }
    if end > i {
        quickSort2(values, i, end)
    }
}

func main() {
    values1 := []int{5, 7, 6, 3, 2, 1, 4, 9, 0, 8}
    values2 := []int{5, 7, 6, 3, 2, 1, 4, 9, 0, 8}
    quickSort1(values1, 0, len(values1)-1)
    quickSort2(values2, 0, len(values2)-1)
    fmt.Println(values1)
    fmt.Println(values2)
}
```

admin
2020-04-01 11:06:05
go

文章分类

文章标签

文章归档

友情链接

go语言快速排序