* Help with combinations...
@ 1993-03-01 8:53 Malcolm S Haar
0 siblings, 0 replies; only message in thread
From: Malcolm S Haar @ 1993-03-01 8:53 UTC (permalink / 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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1993-03-01 8:53 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1993-03-01 8:53 Help with combinations Malcolm S Haar
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox