toms515

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.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

toms515 is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

toms515_test

subset, a Fortran90 code which enumerates combinations, partitions, subsets, index sets, and other combinatorial objects.

Author:

Original Fortran77 version by Bill Buckles, Matthew Lybanon. This version by John Burkardt.

Reference:

  1. Bill Buckles, Matthew Lybanon,
    Algorithm 515: Generation of a Vector from the Lexicographical Index,
    ACM Transactions on Mathematical Software,
    Volume 3, Number 2, June 1977, pages 180-182.

Source Code:

Last revised on 13 March 2021.