mirror of https://github.com/golang/go.git
sort: harden limit in stable test
Reduce the number of allowed swap operations during stable sort. R=golang-dev, bradfitz CC=golang-dev https://golang.org/cl/12907045
This commit is contained in:
parent
264b73b3f2
commit
2f81dfd53f
|
|
@ -350,7 +350,7 @@ func TestHeapsortBM(t *testing.T) {
|
|||
}
|
||||
|
||||
func TestStableBM(t *testing.T) {
|
||||
testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) })
|
||||
testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) / 3 })
|
||||
}
|
||||
|
||||
// This is based on the "antiquicksort" implementation by M. Douglas McIlroy.
|
||||
|
|
|
|||
Loading…
Reference in New Issue