Martin Möhrmann 2c7c727c1c sort: reduce number of comparisons needed by medianOfThree ... For some cases we can ensure the correct order of elements in two instead of three comparisons. It is unnecessary to compare m0 and m1 again if m2 and m1 are not swapped. benchmark old ns/op new ns/op delta BenchmarkSortString1K 302721 299590 -1.03% BenchmarkSortInt1K 124055 123215 -0.68% BenchmarkSortInt64K 12291522 12203402 -0.72% BenchmarkSort1e2 58027 57111 -1.58% BenchmarkSort1e4 12426805 12341761 -0.68% BenchmarkSort1e6 1966250030 1960557883 -0.29% Change-Id: I2b17ff8dee310ec9ab92a6f569a95932538768a9 Reviewed-on: https://go-review.googlesource.com/2614 Reviewed-by: Robert Griesemer <gri@golang.org>		2015-01-13 19:37:02 +00:00
..
example_interface_test.go
example_keys_test.go
example_multi_test.go
example_test.go
example_wrapper_test.go
export_test.go
search_test.go
search.go
sort_test.go
sort.go	sort: reduce number of comparisons needed by medianOfThree	2015-01-13 19:37:02 +00:00