zsort

Documentation

Overview

对无序序列进行排序

Index

• func BubbleSort(data sort.Interface)
• func DictSort(keys []string) []string
• func QuickSort(data sort.Interface)
• func SelectSort(data sort.Interface)
• type Pair
• type PairList
  • func SortByValue(valueMap map[string]int) PairList
  • func (p PairList) Len() int
  • func (p PairList) Less(i, j int) bool
  • func (p PairList) Swap(i, j int)

Examples

• BubbleSort
• QuickSort
• SelectSort

Functions

func BubbleSort

func BubbleSort(data sort.Interface)

BubbleSort 冒泡排序. data必须实现sort包中的Interface接口

Example

// declare a array
// this array must implenet sort.Inerface
data := sort.IntSlice{22, 34, 3, 40, 18, 4}
BubbleSort(data)

func DictSort

func DictSort(keys []string) []string

DictSort 字典排序

func QuickSort

func QuickSort(data sort.Interface)

QuickSort 快速排序, data必须要实现sort包的Interface接口

Example

// declare a array
// this array must implenet sort.Inerface
data := sort.IntSlice{22, 34, 3, 40, 18, 4}
QuickSort(data)

func SelectSort

func SelectSort(data sort.Interface)

SelectSort 选择排序, data必须实现sort包中的Interface接口

Example

// declare a array
// this array must implenet sort.Inerface
data := sort.IntSlice{22, 34, 3, 40, 18, 4}
SelectSort(data)

Types

type Pair

type Pair struct {
	Key   string
	Value int
}

type PairList

type PairList []Pair

func SortByValue

func SortByValue(valueMap map[string]int) PairList

SortByValue 按照map的value进行降序排列

func (PairList) Len

func (p PairList) Len() int

func (PairList) Less

func (p PairList) Less(i, j int) bool

func (PairList) Swap

func (p PairList) Swap(i, j int)