In C++ Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 hen the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas
In C++
Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line.
When the input is:
Julia Lucas Mia -1
hen the output is (must match the below ordering):
Julia Lucas Mia
Julia Mia Lucas
Lucas Julia Mia
Lucas Mia Julia
Mia Julia Lucas
Mia Lucas Julia
#include <
#include <string>
#include <iostream>
using namespace std;
// TODO: Write method to create and output all permutations of the list of names.
void AllPermutations(const vector<string> &permList, const vector<string> &nameList) {
}
int main(int argc, char* argv[]) {
vector<string> nameList;
vector<string> permList;
string name;
// TODO: Read in a list of names; stop when -1 is read. Then call recursive method.
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
