sortutils

Documentation

Index

• func Sort[T cmp.Ordered](x []T, algo Algorithm)
• func SortFunc[T any](x []T, less func(a, b T) bool, algo Algorithm)
• type Algorithm

Functions

func Sort

func Sort[T cmp.Ordered](x []T, algo Algorithm)

Sort sorts x using the chosen algorithm with natural (ordered) comparison.

func SortFunc

func SortFunc[T any](x []T, less func(a, b T) bool, algo Algorithm)

SortFunc sorts x using the chosen algorithm with a custom less function. less(a,b) should return true if a < b.

Types

type Algorithm

type Algorithm int

const (
	QuickSort     Algorithm = iota // Unstable, in-place, average O(n log n)
	MergeSort                      // Stable, O(n log n), extra memory
	HeapSort                       // Unstable, in-place, O(n log n)
	InsertionSort                  // Stable, good for small/near-sorted, O(n^2)
	SelectionSort                  // Unstable, O(n^2)
	BubbleSort                     // Stable (with swap flag), O(n^2)
)