For example, generate Permutations (abc) should return the following strings (in any order): ["abc", "acb", "bac", "bca", "cab", "cba"] Example

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
icon
Related questions
Question

Answer the given question with a proper explanation and step-by-step solution.

please only add to code where it says " add code below this line"
 
C++ please
#include<iostream>
2 #include<string>
3 #include<vector>
4 #include<algorithm>
5 using namespace std;
H
67
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
vector<string> generate Permutations (string& s) {
//add code below this line
}
//add code above this line
void printPermutations (vector<string>arr) {
for (auto s: arr) {
cout<<s<<endl;
}
}
int main(int argc, char* argv[]) {
string s = argv[1];
vector<string>arr = generatePermutations (s);
sort (arr.begin(), arr.end());
printPermutations (arr);
return 0;
Transcribed Image Text:#include<iostream> 2 #include<string> 3 #include<vector> 4 #include<algorithm> 5 using namespace std; H 67 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 vector<string> generate Permutations (string& s) { //add code below this line } //add code above this line void printPermutations (vector<string>arr) { for (auto s: arr) { cout<<s<<endl; } } int main(int argc, char* argv[]) { string s = argv[1]; vector<string>arr = generatePermutations (s); sort (arr.begin(), arr.end()); printPermutations (arr); return 0;
Complete the function vector<string> generate Permutations (string s)
that takes in a strings and returns all the permutations of the string s in a
vector. The function should use recursion to solve the problem.
For example, generate Permutations (abc) should return the following
strings (in any order):
["abc", "acb", "bac", "bca", "cab", "cba"]
Example
int main() {
}
string s= "abc";
vector<string>arr =
generatePermutations (s); // should return ["ab
print Permutations (arr); // should print one string per line ["abc"
return 0;
Transcribed Image Text:Complete the function vector<string> generate Permutations (string s) that takes in a strings and returns all the permutations of the string s in a vector. The function should use recursion to solve the problem. For example, generate Permutations (abc) should return the following strings (in any order): ["abc", "acb", "bac", "bca", "cab", "cba"] Example int main() { } string s= "abc"; vector<string>arr = generatePermutations (s); // should return ["ab print Permutations (arr); // should print one string per line ["abc" return 0;
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education