go排序方法总结

1、方法总结

• sort.Ints
• sort.Floats
• sort.Strings
• sort.SliceStable
• sort.Interface{}

2、实例

?

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

//sort.Ints() s := []int{4, 2, 3, 1} sort.Ints(s) fmt.Println(s) // 输出[1 2 3 4]     //sort.SliceStable() family := []struct {     Name string     Age  int }{     {"Alice", 23},     {"David", 2},     {"Eve", 2},     {"Bob", 25}, } // 用 age 排序，年龄相等的元素保持原始顺序 sort.SliceStable(family, func(i, j int) bool {     return family[i].Age < family[j].Age }) fmt.Println(family) // [{David 2} {Eve 2} {Alice 23} {Bob 25}]  //下面实现排序order by age asc, name desc，如果 age 和 name 都相等则保持原始排序 sort.SliceStable(family, func(i, j int) bool {     if family[i].Age != family[j].Age {         return family[i].Age < family[j].Age     }     return strings.Compare(family[i].Name, family[j].Name) == 1 }) fmt.Println(family) // [{Eve 2} {David 2} {Alice 23} {Bob 25}]     //sort.Interface{} type Person struct {     Name string     Age  int } // ByAge 通过对age排序实现了sort.Interface接口 type ByAge []Person func (a ByAge) Len() int           { return len(a) } func (a ByAge) Less(i, j int) bool { return a[i].Age < a[j].Age } func (a ByAge) Swap(i, j int)      { a[i], a[j] = a[j], a[i] } func main() {     family := []Person{         {"David", 2},         {"Alice", 23},         {"Eve", 2},         {"Bob", 25},     }     sort.Sort(ByAge(family))     fmt.Println(family) // [{David, 2} {Eve 2} {Alice 23} {Bob 25}]       sort. }