使用golang的sort包进行排序

这是在掘金的第一篇文章，之前一直在某书发文章，进来感觉某书越来越不好了，想把文章 都搬到掘金来。
golang和java等语言一样，系统自带了一个排序方法，可以快速实现排序。废话不多说，先上栗子，再解释。

package main

import (
    "fmt"
    "math/rand"
    "sort"
    "strconv"
)

func main() {
    oneArr := make([]*One, 10)
    for i := 0; i < 10; i++ {
        oneArr[i] = &One{
            Name: "name" + strconv.FormatInt(int64(i), 10),
            Num:  rand.Intn(1000),
        }
    }

    for _, v := range oneArr {
        fmt.Print(v, " ")
    }
    fmt.Println()
    sort.Sort(OneList(oneArr))
    for _, v := range oneArr {
        fmt.Print(v, " ")
    }
    fmt.Println()

}

type One struct {
    Num  int
    Name string
}

type OneList []*One

func (this OneList) Len() int {
    return len(this)
}
func (this OneList) Less(i, j int) bool {
    return this[i].Num < this[j].Num
}
func (this OneList) Swap(i, j int) {
    this[i], this[j] = this[j], this[i]
}
复制代码

运行结果

实现从小到大排序

Interface

// A type, typically a collection, that satisfies sort.Interface can be
// sorted by the routines in this package. The methods require that the
// elements of the collection be enumerated by an integer index.
type Interface interface {
    // Len is the number of elements in the collection.
    Len() int
    // Less reports whether the element with
    // index i should sort before the element with index j.
    Less(i, j int) bool
    // Swap swaps the elements with indexes i and j.
    Swap(i, j int)
}
复制代码

Len()Less()Swap()

给 OneList
重写这3个函数

sortSort()

Sort()InterfaceoneArrInterface

sortsort.sort.Reverse()

sort.Sort(sort.Reverse(OneList(oneArr)))

实现从大到下排序

拓展

sort

type IntSlice []int
type Float64Slice []float64
type StringSlice []string

看一个应用栗子:

package main

import (
    "fmt"
    "math/rand"
    "sort"
)

func main() {
    one := make([]int, 10)
    for i := 0; i < 10; i++ {
        one[i] = int(rand.Int31n(1000))
    }
    fmt.Println(one)
    sort.Sort(sort.IntSlice(one))
    fmt.Println(one)

}
复制代码

运行结果:

好了，先介绍到这里。