UVA 10098 Solution

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;


class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int tc = sc.nextInt();
StringBuffer bf = new StringBuffer("");
sc.nextLine();
for (int i =0; i<tc ; i++) {
if (i>0) bf.append("\n");
char [] a =sc.nextLine().toCharArray();
Arrays.sort(a);
//String s =String.valueOf(a);
Arrays.asList(a);
do{
bf.append(new String(a)+"\n");
//System.out.println(new String(a));
}while(next_permutation2(a));


}
System.out.println(bf);

}
public static boolean next_permutation2(char a[])
    {
       for(int i = a.length-2, j; i >= 0; i--)
       {
        if (a[i+1] > a[i])
               {
               for(j = a.length-1; a[j] <= a[i]; j--);
swap(a, i, j);
  for(j = 1; j <= (a.length-i)/2; j++)
  swap(a, i+j, a.length-j);
                     return true;
           }
       }
        return false;
   }


public static void swap(char a[], int i, int j)
{
char temp = a[i];
a[i] = a[j];
  a[j] = temp;
      }
}