Question
Here is the data set: 2 8 11 20 22 23 26 36 38 42 47 49 51 4 6 * 9 27 31 33 37 41* 44 45 from these numbers I need all the different possiblecombinations in a six digit sequence. i.e. xx-xx-xx-xx-xx-xx (06-41-31-44-45-9) The numbers can be in any order. NO TWO SEQUENCES CAN BE THESAME. I was thinking that a recursive program would probably be thebest way to go. maybe not. Thanks!! Here is the data set: 2 8 11 20 22 23 26 36 38 42 47 49 51 4 6 * 9 27 31 33 37 41* 44 45 2 8 11 20 22 23 26 36 38 42 47 49 51 4 6 * 9 27 31 33 37 41* 44 45 from these numbers I need all the different possiblecombinations in a six digit sequence. i.e. xx-xx-xx-xx-xx-xx (06-41-31-44-45-9) The numbers can be in any order. NO TWO SEQUENCES CAN BE THESAME. I was thinking that a recursive program would probably be thebest way to go. maybe not. Thanks!!
Explanation / Answer
please rate - thanks I'm not sure, but I based it on this http://www.vb-helper.com/howto_generate_combinations.html import java.util.*; public class unique { public static void main(String []args) { intnums[]={2,8,11,20,22,23,26,36,38,42,47,49,51,4,6,9,27,31,33,37,41,44,45}; int i,j,k,l,m,n; for(i=0;i