Article View: comp.soft-sys.matlab
Article #30Re: Enumerating Combinations
From: Ravi Krishnamurthy
Date: Sun, 24 Jan 1993 01:25
Date: Sun, 24 Jan 1993 01:25
26 lines
1604 bytes
1604 bytes
In article <1993Jan23.214452.26779@news.yale.edu> wayne@econ.yale.edu (Kevin Wayne) writes: > I want to enumerate all combinations of n items taken p at a time for > arbitrary n, p<=n. > > (i.e., for (n,p)=(5,3) generate a sequence of vectors: > [1 2 3], [1 2 4], [1 2 5], [1 3 4], [1 3 5], [1 4 5], > [2 3 4], [2 3 5], [2 4 5], [3 4 5] ) > Obviously, the computational effort will increase exponentially, but I only > need to use it for relatively small n. > If anyone has written such code, please send e-mail. Thanks in advance. I'm also interested in having this program if someone has it. Can I have copy too? Thanks! -- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Ravi S. Krishnamurthy | Phone: (703) 951-1712 (H) Dept. of Mathematics | 231-4842 (O) Virginia Tech | Internet: krishnam@math.vt.edu Blacksburg, VA 24061-0123 | Bitnet: krishnam@vtmath =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Technical Details
Message-ID:
<KRISHNAM.93Jan23202510@corona.math.vt.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!vtserf!vtserf.cc.vt.edu!krishnamReferences:
<1993Jan23.214452.26779@news.yale.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!vtserf!vtserf.cc.vt.edu!krishnam From: krishnam@math.vt.edu (Ravi Krishnamurthy) Newsgroups: comp.soft-sys.matlab Subject: Re: Enumerating Combinations Message-ID: <KRISHNAM.93Jan23202510@corona.math.vt.edu> Date: 24 Jan 93 01:25:10 GMT References: <1993Jan23.214452.26779@news.yale.edu> Sender: usenet@vtserf.cc.vt.edu Organization: Department of Mathematics, Virginia Tech, VA 24061 Lines: 26 In-reply-to: wayne@econ.yale.edu's message of 23 Jan 93 21:44:52 GMT