Help! Recursive function to print ncr

Question

hi ,everyone
i am writing a program to print out the ncr of an array
ie gievn [1,2,3]
my outcome is expected to be
1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1
however my program output is
12 3
3 2
2 13
3 1
3 1 2
2 1
can somebody help me out to make my program to output the expected outcome
here is the code
import java.util.*;
public class ncrq
     public static void main(String args[])
          int[] value=new int[3];
          value[0]=1;
          value[1]=2;
          value[2]=3;
          printNcr(value);
     public static void printNcr(int[] value)
          if(value.length==0)
               return;
          else
               int[] outcome=new int[value.length-1];
               for(int i=0;i<value.length;i++)
                    System.out.print(value[i]+" ");
                    copyArray(value.length,outcome,value,i);
                    printNcr(outcome);
                    System.out.println();
     public static void copyArray(int originalLength,int[] outcome,int[] income,int i)
          int j=0;
          for(int k=0;k<originalLength;k++)
               if(k!=i)
               outcome[j++]=income[k];
}

Answer 1

I would say to treat each character more like a symbol because that's how we handle such problems. Then write a method that tracks the position of each symbol / object and bumps it to antoher position and it'll do this for each object.
such as:
123
where 1 is obj a, 2 is obj b, and 3 is obj c.
Then pick on obj b and bump it to obj c's position and print the result, then bump it to obj a's position.
123 ---> 132 DONE focusing on obj a.
213 ---> 231 DOND focusing on obj b.
312 ---> 321 DOND focusing on obj c.
The number of bumps for each object will be determined by the original objects size, so a 3 digit number would have two bumps for each object and a 4 digit number (1234) would have 3 bumps per obj, etc....
A key part to this letting each obj stand in as a "leader" and having two bumps after it's assignment. Otherwise you'll recieve duplicate values.
So you would get (leaders are in bold): 1,2,3 ----> 1,3,2 ----> 2,1,3 -----> 2,3,1 -----> 3,1,2 ---->3,2,1