sort

Documentation

Index

• func Element(data sort.Interface, n int)
• func HeapSort(data sort.Interface)
• func IsPartialSorted(data sort.Interface, m int) bool
• func PartialSort(data sort.Interface, m int)

Functions

func Element

func Element(data sort.Interface, n int)

Element finds the nth rank ordered element and ensures it is at the nth position.

func HeapSort

func HeapSort(data sort.Interface)

heapSort implement heap sorting of all elements in data

func IsPartialSorted

func IsPartialSorted(data sort.Interface, m int) bool

func PartialSort

func PartialSort(data sort.Interface, m int)

Rearranges elements such that the range [0, m) contains the sorted m smallest elements in the range [first, data.Len). The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range [m, data.Len) is unspecified.