Like string formatting, sorting is a frequently used operation in many programs. Although a minimal Quicksort can be written in about 15 lines, a robust implementation is much longer, and it is not the kind of code we should wish to write anew or copy each time we need it.
sort package provides in-place sorting of any
sequence according to any ordering function.
Its design is rather unusual.
In many languages, the sorting algorithm is associated with the sequence
data type, while the ordering function is associated with the type of
By contrast, Go’s
sort.Sort function assumes nothing about the representation of either the sequence or its elements. Instead, it uses an interface, ...