Codigo:
//* Permutaciones (Forma recursiva)
//- Importa posición
//- Con repetición
package permutacion1;
public class Permutacion1 {
public static void main(String[] args) {
String[] elementos = "a,b,c,d,e".split(",");
int n = 4; //Tipos para escoger
int r = elementos.length; //Elementos elegidos
Perm1(elementos, "", n, r);
}
private static void Perm1(String[] elem, String act, int n, int r) {
if (n == 0) {
System.out.println(act);
} else {
for (int i = 0; i < r; i++) {
Perm1(elem, act + elem[i] + ", ", n - 1, r);
}
}
}
}
a, a, a, a,
a, a, a, b,
a, a, a, c,
...
...
...
e, e, e, c, e, e, e, d,
e, e, e, e,
BUILD SUCCESSFUL (total time: 0 seconds)