Question

Create the following function in java:

ALGORITHM PERMUTATION GENERATOR PermGenerator(integer n 22) li generates in lexicographical order all permutations llof the integers in the set {I.....!! Local variables: integers i //indices of permutation elements integer //for loop counter integers d., d..., Mleft to right elements of a permutation Section 4.4 Permutations and Combinations 283 1/create and write out smallest permutation for k=1 to n do end for write d.d..... //create and write out remaining permutations for k = 2 to n do Mook right to left for first break in increasing sequence in-1 while d >d do still increasing right to left 11-1 j=1-1 end while I now d <d, need to replaced with next largest integer look right to left for smallest value greater thand, i= while d > d do =)-1 end while I now d, is smallest value > swap d, and a \/reverse the digits to the right of index i i=1+! while i<j do swap dand d 1=1+1 y = -1 end while writed d...de end for end function PermGenerator

Answer 1

SampleOutput:

RawCode:

import java.util.*;
class permutation
{
   public static int fact(int n)        //factorial function in recursion
   {
  
   return(n==1||n==0)?1:n*fact(n - 1);
   }
   public static int PermGenerator(int n)  
   {
     
       int i,j;   //declaring variables
       int k;
       int[] d;   //initialinzing array
       d=new int [n+1];   //allocating memory for array
       for(k=1;k<=n;k++)   //creatinh smallest permutation
           d[k-1]=k;
       for(i=0;i<n;i++)
           System.out.print(d[i]);
       System.out.println("\n");
       for(k=2;k<=fact(n);k++)
       {
           i=n-1;
           j=n;
           while(d[i-1]>d[j-1])
           {
               i=i-1;
               j=j-1;
           }
           j=n;
           while(d[i-1]>d[j-1])
               j=j-1;
           int temp=d[i-1];   //swaping
           d[i-1]=d[j-1];
           d[j-1]=temp;
           i=i+1;       //incrementing i value
           j=n;  
           while(i<j)
           {
               int t=d[i-1];       //swaping
               d[i-1]=d[j-1];
               d[j-1]=t;
               i=i+1;
               j=j-1;
           }
           for(int a=0;a<n;a++)
               System.out.print(d[a]);   //printing permutation
           System.out.println("\n");
       }
       return -1;
}
public static void main(String args[])       //main method
{
    Scanner sc=new Scanner(System.in);      
    int n;
    System.out.println("Enter the n value: ");   //getting input from user
    n=sc.nextInt();
    System.out.println("\n");
    PermGenerator(n);       //calling the PermGenerator() function
}
}

--------------------------------------------------------------------------

Hope you understand.If you have any doubts comment me.Upvote me.