From: mhaar@cymbal.calpoly.edu (Malcolm S Haar)
Subject: Help with combinations...
Date: Mon, 01 Mar 1993 08:53:57 GMT
Date: 1993-03-01T08:53:57+00:00 [thread overview]
Message-ID: <1993Mar01.085357.130319@zeus.calpoly.edu> (raw)
I am trying develop a function that will return all n-length unique
combinations of a given set of items.
My goal is:
function (pointer_to_list_of_items,n) return pointer_to_list_of_combinations
-----
if n = 2, and pointer_to_list_of_items points to a list: A,B,C
then the function will return a pointer to: A,B A,C B,C
----
The pointers, etc. are not of concern to me -- I know how to use them. Also, I can implement the function for a constant n. I would, however, like to be able to create a function like the one shown above, which would allow for any n.
Thanks in advance for any help.
Malcolm
mhaar@oboe.calpoly.edu
reply other threads:[~1993-03-01 8:53 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox