This repository hosts the beginnings of a Go package for computing the permutations of generic slices as generator functions leveraging goroutines under-the-hood.
So far implemented are Heap's Algorithm, in both flat and recursive forms, for finding all possible permutations and Fisher-Yates-Shuffling & Reservoir Sampling for finding permutations randomly until a predefined number have been obtained.
The benefit of the latter type of generation over the former is if the permutated slice has a length greater than eleven such that finding all its possible permutations is unfeasible, since Heap's Algorithm has order