11.10 LAB: All permutations of names 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 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 Please help with //TODO #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; }

11.10 LAB: All permutations of names 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 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 Please help with //TODO #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; }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 11SA

See similar textbooks

11.10 LAB: All permutations of names 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

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

Please help with //TODO

#include <vector>
#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;
}

Process by which instructions are given to a computer, software program, or application using code.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2 : Code

VIEW

Step 3 : Output

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

5.18 C++ Write a program that reads a list of integers, and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2,
6.28 In Python, Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique. END WITH A NEW LINE
6.8 In Python, An acronym is a word formed from the initial letters of words in a set phrase. Write a program whose input is a phrase and whose output is an acronym of the input. If a word begins with a lower case letter, don't include that letter in the acronym. Assume there will be at least one upper case letter in the input. Ex: If the input is: Institute of Electrical and Electronics Engineers the output is: IEEE
1. Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is:********************Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the above pattern. 2. A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameter.
6.28 In Python, Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique.
Exercise 20 the string below comes from an alphabet consisting of only characters A and B. Accordingly, write the full code of the program (Use the given space below the question. If you struggle to fit into the space then upload a file) that prints the permutation list that can be formed with the characters A or B, which can replace the question marks, into a text file. (Hint: give a go to recursion) A?AA?BB?A? The output will be like the list below: ABAABBBBAB ABAABBBBAA ABAABBBAAB ABAABBBAAA ABAAABBBAB ABAAABBBAA ABAAABBAAB ABAAABBAAA AAAABBBBAB AAAABBBBAA AAAABBBAAB AAAABBBAAA AAAAABBBAB AAAAABBBAA AAAAABBAAB AAAAABBAAA
Part I Implement the Fibonnaci SequenceOne of this week’s quiz questions referred to the Fibonnaci sequence. This sequence of numbers is definedsuch that the nth number of the sequence is simply the sum of the two previous numbers in the sequence. Informal terms, Fn = Fn1 + Fn2, where Fnis the nth Fibonnaci number. Write a function in recursion.py, calledfibonnaci, which will accept one integer parameter (lets call it n) and returns the nth element of the Fibonnacisequence.Part II Implement Euclid’s GCD AlgorithmThe greatest common divisor, or GCD, of two integers is the largest number that divides both of them withno remainder. Euclid’s algorithm is one method to find the GCD of two numbers. Mathematically, we knowthat if r is the remainder when a is divided by b, then gcd(a, b) = gcd(b, r). Write a recursive function calledgcd that takes parameters a and b and returns their greatest common divisor. Think about what the basecase is for this algorithm.Part III String…
(7) Implement the ShortenSpace() function. ShortenSpace() has a string parameter and updates the string by replacing all sequences of 2 or more spaces with a single space. ShortenSpace() DOES NOT output the string. Call ShortenSpace() in the PrintMenu() function, and then output the edited string. Ex: Edited text: We'll continue our quest in space. There will be more shuttle flights and more shuttle crews and, yes, more volunteers, more civilians, more teachers in space. Nothing ends here; our hopes and our journeys continue!
1. Implement a recursive function called firstTwo that returns the sum of the firsttwo digits in a positive number. If there is only one digit, that digit is returned.Note this function is returning an integer, not printing. There should be no use ofcout within your function.Title line: int firstTwo(int n)ex. firstTwo(8325) returns 11ex. cout << firstTwo(428); // prints 62. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called…
1. Implement a recursive function called firstTwo that returns the sum of the firsttwo digits in a positive number. If there is only one digit, that digit is returned.Note this function is returning an integer, not printing. There should be no use ofcout within your function.Title line: int firstTwo(int n)ex. firstTwo(8325) returns 11ex. cout << firstTwo(428); // prints 62. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called…
3. A palindrome is a sentence that contains the same sequence of letters read-ing it either forwards or backwards. A classic example is "Able was I, ere I saw Elba." Write a recursive function that detects whether a string is a palindrome. The basic idea is to check that the first and last letters of the string are the same letter; if they are, then the entire string is a palindrome if everything between those letters is a palindrome. There are a couple of special cases to check for. If either the first or last character of the string is not a letter, you can check to see if the rest of the string is a palindrome with that character removed. Also, when you compare letters, make sure that you do it in a case-insensitive way. Use your function in a program that prompts a user for a phrase and then tells whether or not it is a palindrome. Here's another classic for testing: "A man, a plan, a canal, Panama!"
Q1: A positive integer is entered through the keyboard, write a function to display the Fibonacci series upto ‘n’ positive integer (1) Without using recursion (2) Using recursion . Q2: To fully define a variable one needs to mention not only its ‘type’ but also its ‘other properties’. In other words, not only do all variables have a data type, they also contain other properties. Explain the concept that will help us to describe the properties of any variable.