import java.util.*; public class Seb{ public static void main(String[] args){ int n=0; int T[] = new int[10]; for (int i = 0; i < T.length ; i++){ T[i]=T.length - i; } QS(T,0,T.length); aff(T); } public static void QS ( int[] T,int i, int j ){ if ( (j-i)>1 ){ int k; aff(T); k = separer (T ,i ,j); aff(T); QS(T,i,k); QS(T,k+1,j); } } public static void aff (int[] T){ for (int i = 0 ; i < T.length ; i++){ System.out.print(T[i] + " "); } System.out.println(""); } public static int separer (int[] T,int i, int j){ int j1,k; j1 = i+1; k =i; while (j1 != j){ if (T[k]