home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.os.msdos.apps
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!rpi!scott.skidmore.edu!pvonk
- From: pvonk@scott.skidmore.edu (Pierre VonKaenel)
- Subject: Re: 'All Possible Combinations' Algorithms
- Message-ID: <1992Nov23.141641.13747@scott.skidmore.edu>
- Organization: Skidmore College, Saratoga Springs NY, 12866
- References: <By0wH5.D3L@apollo.hp.com> <1992Nov23.130227.1@sc2a.unige.ch>
- Date: Mon, 23 Nov 1992 14:16:41 GMT
- Lines: 19
-
- In article <1992Nov23.130227.1@sc2a.unige.ch> fisher@sc2a.unige.ch writes:
- >In article <By0wH5.D3L@apollo.hp.com>, holbrook@apollo.HP.COM (Alan R. Holbrook) writes:
- >> Can someone provide me with an algorithm suitable for writing a program
- >> to dump all possible combinations of 'n' elements taken 'm' at a time?
- >
- >Wrong group, but here it goes (in somewhat portable c):
- >
-
- I certainly hope that Mr. Holbrook isn't a student looking for someone
- to do his homework. As an aside, I once discovered students roaming
- our halls asking help on math problems. Turns out they were from
- another school getting answers for a take home exam! The Internet now
- provides unlimited possibilities ! :-)
-
- --
- Pierre von Kaenel | Skidmore College | pvonk@skidmore.edu
- Math & CS Dept. | Saratoga Springs, NY 12866 | (518)584-5000 Ext 2391
-
- "Experience is the name everyone gives to their mistakes." Oscar Wilde
-