BinarySearch looks for toFind in a sorted slice, and returns the index at which it either is or would be were it to be inserted.

BinarySearchFunc looks for toFind in an increasing function of domain 0 ..

InvertPermutation input permutation must contain exactly 0, ..., len(permutation)-1.

Permute operates in-place but is not thread-safe; it uses the permutation for scratching permutation[i] signifies which index slice[i] is going to.

TopologicalSort takes a list of lists of dependencies and proposes a sorting of the lists in order of dependence.