1
0
mirror of https://github.com/golang/go synced 2024-11-22 05:34:39 -07:00

sort: add time complexity to doc

Let's tell the world that Go's sort is O(n log n).
Surely this is a feature we intend to keep.

R=golang-dev, gri
CC=golang-dev
https://golang.org/cl/5867045
This commit is contained in:
Stefan Nilsson 2012-03-22 09:27:02 -07:00 committed by Robert Griesemer
parent 2795a15c0c
commit 08959defa8

View File

@ -184,7 +184,8 @@ func quickSort(data Interface, a, b, maxDepth int) {
}
// Sort sorts data.
// The algorithm used is not guaranteed to be a stable sort.
// It makes one call to data.Len to determine n, and O(n*log(n)) calls to
// data.Less and data.Swap. The sort is not guaranteed to be stable.
func Sort(data Interface) {
// Switch to heapsort if depth of 2*ceil(lg(n+1)) is reached.
n := data.Len()