Java Realizes Full Arrangement of n Numbers

n digits in Full Permutation n!Species.

This permutation only outputs character numeric permutations, the output is character numeric.This problem 1 generally requires a recursive approach.

The java code is as follows:

public class Test {
static int k=0;
public static void main(String[] args) {
  int a[]={1,2,3,4,5};
  permutations(a,0,4);
}
public static void permutations(int[]a,int m,int n){
  if(m==n){
    k++;
    System.out.print(k+" individual :");
    for(int i=0;i<=n;i++){
      System.out.print(a[i]);
    }
    System.out.println();
  }else{
    for(int i=m;i<=n;i++){
      int temp=a[m];
      a[m]=a[i];
      a[i]=temp; 
      permutations(a,m+1,n);
      temp=a[m];
      a[m]=a[i];
      a[i]=temp;
    }
  }
}

summary