diff options
| author | Matt Bostock <matt@mattbostock.com> | 2015-08-16 22:10:45 +0100 |
|---|---|---|
| committer | Rob Pike <r@golang.org> | 2015-08-17 06:58:16 +0000 |
| commit | 3c4315808752a14a018b443bf02e4543146a69e8 (patch) | |
| tree | 137044b2f02349cbf7c482da04ccabaaace174c5 | |
| parent | 467a2cb73ca867ccdb1dd22be220fa51b6d52491 (diff) | |
| download | go-3c4315808752a14a018b443bf02e4543146a69e8.tar.gz go-3c4315808752a14a018b443bf02e4543146a69e8.zip | |
sort: Fix typo in Stable() comment
Correct 'an' to 'on' in the comment above the Stable() function.
Change-Id: I714e38b2d3a79dfd539d5368967d1c6b519cb948
Reviewed-on: https://go-review.googlesource.com/13662
Reviewed-by: Rob Pike <r@golang.org>
| -rw-r--r-- | src/sort/sort.go | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/sort/sort.go b/src/sort/sort.go index 0a446c8255..c7c30426ae 100644 --- a/src/sort/sort.go +++ b/src/sort/sort.go @@ -300,7 +300,7 @@ func StringsAreSorted(a []string) bool { return IsSorted(StringSlice(a)) } // V. Raman in Algorithmica (1996) 16, 115-160: // This algorithm either needs additional 2n bits or works only if there // are enough different elements available to encode some permutations -// which have to be undone later (so not stable an any input). +// which have to be undone later (so not stable on any input). // - All the optimal in-place sorting/merging algorithms I found are either // unstable or rely on enough different elements in each step to encode the // performed block rearrangements. See also "In-Place Merging Algorithms", |