if u have a string "abc" then the output should be: abc, acb,bac,bca,cba,cab
Type: Posts; User: ueg1990
if u have a string "abc" then the output should be: abc, acb,bac,bca,cba,cab
public static void combString(String s) {
char[] a = new char[s.length()];
//String temp = "";
for(int i = 0; i < s.length(); i++) {
a[i] = s.charAt(i);
}
for(int i = 0; i < s.length(); i++) {...
im trying to find permutation of a given string but i want to use iteration. The recursive solution i found online and i do understand it but converting it to an iterative solution is really not...