Article View: sci.math.stat
Article #733Request for code for enumerating combinations
From: David Lubinsky
Date: Mon, 14 Dec 1992 11:09
Date: Mon, 14 Dec 1992 11:09
21 lines
1370 bytes
1370 bytes
Does anyone have any code that they would be willing to share that steps through each possible combination of n choose m items. I know this is not too hard to do recursivley, but am hoping to find some efficient implementation, since I need to do this for quite large n's and m's. Thanks David ----------------------------------------------------------------------- David Lubinsky david@concave.cs.wits.ac.za Dept. of Computer Science Phone: 27 11 716-3459 University of Witwatersrand FAX: 27 11 339-7965 Private Bag 3, Wits 2050 Home: 27 11 646-2929 Johannesburg, South Africa -- ----------------------------------------------------------------------- David Lubinsky david@concave.cs.wits.ac.za Dept. of Computer Science Phone: 27 11 716-3459 University of Witwatersrand FAX: 27 11 339-7965
Technical Details
Message-ID:
<david.724331390@concave>Path:
arc1-ca.pugleaf.net!sparky!uunet!psgrain!hippo!shannon!concave!davidShow Full Headers
Complete Article Headers
Newsgroups: sci.math.stat Path: arc1-ca.pugleaf.net!sparky!uunet!psgrain!hippo!shannon!concave!david From: david@concave.cs.wits.ac.za (David Lubinsky) Subject: Request for code for enumerating combinations Message-ID: <david.724331390@concave> Sender: news@shannon.ee.wits.ac.za Organization: Computer Science, University of the Witwatersrand Date: 14 Dec 92 11:09:50 GMT Lines: 21