1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why?
1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Attached is a
My questions regarding the recursion part:
1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why?
Transcribed Image Text:Word Scrambler
Time Limit: 0.6s
Memory Limit: 32M
Looking to find some clever anagrams, you want a helper tool that will list all possible arrangements of letters for a
given source word. To make the list easier to scan, the output should be in ascending sorted order.
Input Specification
The input will consist of one string of lower-case alphabet characters, at least 1 character long, and no more than 5.
Output Specification
The output should contain all the possible combinations of letters in the word, sorted alphabetically.
To make things easier, all of the letters in each word are guaranteed to be unique (so then every combination will also
be unique).
Note: since there are n! possibilities for combinations of n letters, you can use that fact to check that you have the right
number of possibilities in your output.
Sample Input
abc
Sample Output
abc
acb
bac
bca
cab
cba
![import java.util.*;
import java.io.*;
public class Main
{
static void printPermutation(String str, String ans)
{
if (str.length()==e){
System.out.println(ans);
}
for (int i=0;i<str.length();i++) {
char ch = str.charAt (i);
String leftover=str.substring(0,i)+str.substring(i+1);
printPermutation(left0ver, ans: ans+ch);
}
}
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
String str=scan.nextLine();
char[] arrCh=str.toCharArray();
Arrays.sort(arrCh);
str-String.copyValueOf(arrCh);
printPermutation(str, ans: "");
}
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff44733ff-005d-45a4-acf5-d2bfd25cba70%2F51a6f614-2d2e-435f-86bc-74e82b30ee7c%2Fwp7qa7_processed.png&w=3840&q=75)
Transcribed Image Text:import java.util.*;
import java.io.*;
public class Main
{
static void printPermutation(String str, String ans)
{
if (str.length()==e){
System.out.println(ans);
}
for (int i=0;i<str.length();i++) {
char ch = str.charAt (i);
String leftover=str.substring(0,i)+str.substring(i+1);
printPermutation(left0ver, ans: ans+ch);
}
}
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
String str=scan.nextLine();
char[] arrCh=str.toCharArray();
Arrays.sort(arrCh);
str-String.copyValueOf(arrCh);
printPermutation(str, ans: "");
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education