Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements.
-
Updated
Feb 6, 2018 - JavaScript
Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements.
Generator for k-permutations and k-combinations in C++. These are represented by a simplified model based on an urn.
Add a description, image, and links to the k-combinations topic page so that developers can more easily learn about it.
To associate your repository with the k-combinations topic, visit your repo's landing page and select "manage topics."