home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #30 / NN_1992_30.iso / spool / sci / math / stat / 2590 < prev    next >
Encoding:
Text File  |  1992-12-14  |  1.3 KB  |  32 lines
  1. Newsgroups: sci.math.stat
  2. Path: sparky!uunet!psgrain!hippo!shannon!concave!david
  3. From: david@concave.cs.wits.ac.za (David Lubinsky)
  4. Subject: Request for code for enumerating combinations
  5. Message-ID: <david.724331390@concave>
  6. Sender: news@shannon.ee.wits.ac.za
  7. Organization: Computer Science, University of the Witwatersrand
  8. Date: 14 Dec 92 11:09:50 GMT
  9. Lines: 21
  10.  
  11. Does anyone have any code that they would be willing to share that
  12. steps through each possible combination of n choose m items.
  13.  
  14. I know this is not too hard to do recursivley, but am hoping to find
  15. some efficient implementation, since I need to do this for quite large
  16. n's and m's.
  17.  
  18. Thanks
  19. David
  20. -----------------------------------------------------------------------
  21. David Lubinsky                              david@concave.cs.wits.ac.za
  22. Dept. of Computer Science                         Phone: 27 11 716-3459
  23. University of Witwatersrand                         FAX: 27 11 339-7965
  24. Private Bag 3, Wits 2050                           Home: 27 11 646-2929
  25. Johannesburg, South Africa
  26.  
  27. --
  28. -----------------------------------------------------------------------
  29. David Lubinsky                              david@concave.cs.wits.ac.za
  30. Dept. of Computer Science                         Phone: 27 11 716-3459
  31. University of Witwatersrand                         FAX: 27 11 339-7965
  32.