code review 5867045: sort: add time complexity to doc

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.

[Stefan Nilsson, 2012-03-20 22:21:02]

Hello golang-dev@googlegroups.com,

I'd like you to review this change to
https://go.googlecode.com/hg/

[gri, 2012-03-21 20:46:57]

Please rephrase a bit.

http://codereview.appspot.com/5867045/diff/3002/src/pkg/sort/sort.go
File src/pkg/sort/sort.go (right):

http://codereview.appspot.com/5867045/diff/3002/src/pkg/sort/sort.go#newcode188
src/pkg/sort/sort.go:188: // It makes O(n log(n)), where n = data.Len(), calls
to data.Less and data.Swap.
// Sort sorts data.
// 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.

[Stefan Nilsson, 2012-03-22 15:46:16]

Hello golang-dev@googlegroups.com, gri@golang.org (cc:
golang-dev@googlegroups.com),

Please take another look.

[gri, 2012-03-22 16:26:42]

LGTM
thanks.
- gri

[gri, 2012-03-22 16:27:07]

*** Submitted as http://code.google.com/p/go/source/detail?r=0ec67c4df6bd ***

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
http://codereview.appspot.com/5867045

Committer: Robert Griesemer <gri@golang.org>