- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for partialInsertionSort_func (0.31 sec)
-
src/sort/zsortfunc.go
j-- } if i > j { break } data.Swap(i, j) i++ j-- } return i } // partialInsertionSort_func partially sorts a slice, returns true if the slice is sorted at the end. func partialInsertionSort_func(data lessSwap, a, b int) bool { const ( maxSteps = 5 // maximum number of adjacent out-of-order pairs that will get shifted
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0)