diff options
| author | Florin Patan <florinpatan@gmail.com> | 2015-02-09 00:27:38 +0100 |
|---|---|---|
| committer | Brad Fitzpatrick <bradfitz@golang.org> | 2015-02-08 23:38:50 +0000 |
| commit | 0ca49135a0976b6dc2fb1c25a526045c5366971c (patch) | |
| tree | c956180220c4b8eca5dea018f398c31d41659e27 /src/sort | |
| parent | 9e6869b93bba5c04e9536e26944d657f15a88386 (diff) | |
| download | go-0ca49135a0976b6dc2fb1c25a526045c5366971c.tar.gz go-0ca49135a0976b6dc2fb1c25a526045c5366971c.zip | |
sort: fixed small typo in comments
There was a small typo in the comment before the Stable function.
Change-Id: Ia6fa5272aa7869124a637d2eeda81c4f35ef46c8
Reviewed-on: https://go-review.googlesource.com/4201
Reviewed-by: Brad Fitzpatrick <bradfitz@golang.org>
Diffstat (limited to 'src/sort')
| -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 b52b54ed8f..0a446c8255 100644 --- a/src/sort/sort.go +++ b/src/sort/sort.go @@ -296,7 +296,7 @@ func StringsAreSorted(a []string) bool { return IsSorted(StringSlice(a)) } // and Jukka Teuhola; Nordic Journal of Computing 3,1 (1996), 27-40: // The given algorithms are in-place, number of Swap and Assignments // grow as n log n but the algorithm is not stable. -// - "Fast Stable In-Plcae Sorting with O(n) Data Moves" J.I. Munro and +// - "Fast Stable In-Place Sorting with O(n) Data Moves" J.I. Munro and // 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 |