A Fortran Subroutine to Produce Combinations of n Distinct Things Taken m at a Time
James P. Grimes · 1971
Abstract : A Fortran subroutine to generate all or particular combinations of n things taken m at a time is herein described. The procedure establishes and tabulates a certain one-to-one correspondence between the integers from 1 to (sub n)C(sub m) and the individual combinations of n distinct 'things' taken m at a time, where (sub n)C(sub m) = n over m(n-m). In all cases, the set of 'things' treated by the subroutine is the set of integers (1,...,n).