toms515, a FORTRAN90 code which lists the subsets of size K selected from a set of size N, by Bill Buckles, Matthew Lybanon.
The text of many ACM TOMS algorithms is available online through ACM: https://calgo.acm.org/ or NETLIB: https://www.netlib.org/toms/index.html.
The computer code and data files made available on this web page are distributed under the MIT license
toms515 is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
SUBSET, a FORTRAN90 code which enumerates combinations, partitions, subsets, index sets, and other combinatorial objects.
Original FORTRAN77 version by Bill Buckles, Matthew Lybanon. FORTRAN90 version by John Burkardt.