algorithm

func BinaryBound ¶

func BinaryBound(first, last int, comp func(middle int) bool) int

BinaryBound std::lower_bound or std::upper_bound

chose (middle, last) when comp return true
chose [first, middle) when comp return false
lower_bound comp example, { return a[middle] < v }
upper_bound comp example, { return a[middle] <= v }

func NextPermutation ¶

func NextPermutation[T any](
	slice []T, first, last int,
	less func(a, b T) bool,
) bool

NextPermutation std::next_permutation

func Reverse ¶

func Reverse[T any](slice []T, first, last int)

Reverse std::reverse