Thread View: sci.math.stat
1 messages
1 total messages
Started by David Lubinsky
Mon, 14 Dec 1992 11:09
Request for code for enumerating combinations
Author: 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
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads