Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Question re: Enumeration algorithm

0 views
Skip to first unread message

Rex Liquigan

unread,
Jun 17, 1997, 3:00:00 AM6/17/97
to

Hi. Can anyone suggest an efficient algorithm to enumerate all k-tuples
(order not important) from a set of N elements? I'd appreciate any help.

Thanks,

Rex Liquigan
r...@tamu.edu

Glenn Rhoads

unread,
Jun 19, 1997, 3:00:00 AM6/19/97
to

Rex Liquigan <r...@tamu.edu> writes:

>Hi. Can anyone suggest an efficient algorithm to enumerate all k-tuples
>(order not important) from a set of N elements? I'd appreciate any help.

I have C code on my snippets page for generating all k-combinations (the
usual term) of 1 through n in Lexicographic, minimal exchange, colex, and
alternating lexicographic order. The URL is
http://remus.rutgers.edu/~rhoads/Code/code.html

--
Glenn C. Rhoads http://eden.rutgers.edu/~rhoads/
Rutgers University Phone: (908) 445-4634 ext.25
Dept. of Computer Science email: rho...@paul.rutgers.edu
Piscataway, NJ

0 new messages