• Martin Möhrmann's avatar
    sort: reduce number of comparisons needed by medianOfThree · 2c7c727c
    Martin Möhrmann authored
    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/2614Reviewed-by: 's avatarRobert Griesemer <gri@golang.org>
    2c7c727c
Name
Last commit
Last update
..
example_interface_test.go Loading commit data...
example_keys_test.go Loading commit data...
example_multi_test.go Loading commit data...
example_test.go Loading commit data...
example_wrapper_test.go Loading commit data...
export_test.go Loading commit data...
search.go Loading commit data...
search_test.go Loading commit data...
sort.go Loading commit data...
sort_test.go Loading commit data...