From: Florin Patan Date: Sun, 8 Feb 2015 23:27:38 +0000 (+0100) Subject: sort: fixed small typo in comments X-Git-Tag: go1.5beta1~2083 X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=0ca49135a0976b6dc2fb1c25a526045c5366971c;p=gostls13.git 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 --- 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