Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements, with and without replacement.
