SanJuanWolf89
Last Activity: Sep 15 '10, 09:01 AM
Joined: Sep 13 '10
Location:
-
i'll try it out and let you know if it works tomorrow morning;)tks a lot -
can you explain better what function you refer to in algorithm 1?I have thought off a function to combine element but I don't know if you refer to the same thing.
I can't use the second because the elements of each list are not numbered but you can refer to the next element of each list by using *next for example
Code:list[1] = 1, 2, 5 ... list[i] = 1 , list[1]->next = 2
Leave a comment:
-
so, I'll explain you the problem from the beginning...
the assignment gives me an array of lists,each single list is identified by an ID and contains some integer values which can't be repeated in the same combination.
The number of integer in each list can vary for example:
list[1] : 1, 2, 5
list[2]: 7, 8
list[3]: 9 , 13, 15, 17
list[1] contains 3 element , list[2] 2 elements and list[3] contains...Leave a comment:
-
Programming C : combinations of n int from m sets
Hi, I have a problem in finding a code to work out all possible combinations of n int (digits) from m sets; the number of sets is given in input the number of digits in each set may vary from 1 to n. For example:
s[1] = 1, 2, 8, 5
s[2] = 6,
s[3] = 10, 3
should produce:
combo1: 1 6 10
combo2: 1 6 3
combo3: 2 6 10
combo4: 2 6 3
combo5: 8 6 10
combo6: 8 6...
No activity results to display
Leave a comment: