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
then 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 ------File: main.cpp------
#include
#include
#include
using namespace std;
// TODO: Write method to create and output all permutations of the list of names.
void AllPermutations(const vector &permList, const vector &nameList) {
}
int main(int argc, char* argv[]) {
vector nameList;
vector permList;
string name;
// TODO: Read in a list of names; stop when -1 is read. Then call recursive method.
return 0;
}

Question

contestada

Respuesta :

jayilych4real jayilych4real · Answer 1 · 2022-07-21T19:51:59+02:00

The code that lists all the possible permutations until -1 that corrects the problem in your code is:

#include <algorithm>

#include <iostream>

#include <vector>

int main() {

std::vector<std::string> names{

"Julia", "Lucas", "Mia"

};

// sort to make sure we start with the combinaion first in lexicographical order.

std::sort(names.begin(), names.end());

do {

// print what we've got:

for(auto& n : names) std::cout << n << ' ';

std::cout << '\n';

// get the next permutation (or quit):

} while(std::next_permutation(names.begin(), names.end()));

}