NAME

Math::Combination_out

SYNOPSIS

    use Math::Combination_out;

    # @words - array for combinatorics; $k - length for combinatorics
    my @words = qw/a1 b2 c3 d4 e5 f6/;
    my $k = 4;
    print "---Combinations without repetition---\n\n";
    print combinations_without_repetition(\@words, $k), "\n";
    print num_rem(combinations_without_repetition(\@words, $k)), "\n";
    my @words = qw/a1 b2 c3/;
    my $k = 3;
    print "---Combinations with repetition---\n\n";
    print combinations_with_repetition(\@words, $k), "\n";
    print num_rem(combinations_with_repetition(\@words, $k)), "\n";

DESCRIPTION

Combinations without/with repetition

EXPORT

combinations_without_repetition, combinations_with_repetition, num_rem

AUTHOR

Petar Kaleychev <petar.kaleychev@gmail.com>

BUGS

Report them to the author

REFERENCES

Siegfried Koepf, Fast Combinatorial Algorithms in C, http://www.aconnect.de/friends/editions/computer/combinatoricode_e.html

SEE ALSO

Math::Counting, Math::Subsets::List, Math::Combinatorics, Algorithm::Combinatorics

COPYRIGHT

Copyright (c) 2014 Petar Kaleychev

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>.