Sequence Accumulation
Write n function
T accum(
that forms and returns the “sum” of all items in the vector v passed to it. For example, if T is a numeric type such as int or double, the numeric sum will be returned, and if T represents the STL string type, then the result of concatenation is returned.
NOTE: For any type T, the expression T() yields the value or object created by the default constructor. For example, T() yields the empty string object if T is the string class. If T represents a numeric type such as 1nt, then T() yields 0. Use this fact to initialize your “accumulator.”
Test your function with a driver
Want to see the full answer?
Check out a sample textbook solutionChapter 16 Solutions
Starting Out With C++: Early Objects (10th Edition)
Additional Engineering Textbook Solutions
Problem Solving with C++ (9th Edition)
Starting Out with Programming Logic and Design (4th Edition)
Starting out with Visual C# (4th Edition)
C How to Program (8th Edition)
Using MIS (10th Edition)
Problem Solving with C++ (10th Edition)
- /* Movie List Example --Showing how to use vectors and structures */ #include <iostream> #include <iomanip> #include <string> #include <vector> using namespace std; // define a struct for a Movie object struct Movie // It is common for the struct name to be capitalized { string title = ""; // First member of structure - and initialized int year = 0; // Second member of structure - and initialized }; int main() { cout << "The Movie List program\n\n" << "Enter a movie...\n\n"; // get vector of Movie objects vector<Movie> movie_list; char another = 'y'; while (tolower(another) == 'y') { Movie movie; // make temporary new (initialized) Movie object cout << "Title: "; getline(cin, movie.title); cout << "Year: "; cin >> movie.year; movie_list.push_back(movie);…arrow_forwardC++ Sort a vector Define a function named SortVector that takes a vector of integers as a parameter. Function SortVector() modifies the vector parameter by sorting the elements in descending order (highest to lowest). Then write a main program that reads a list of integers from input, stores the integers in a vector, calls SortVector(), and outputs the sorted vector. The first input integer indicates how many numbers are in the list. Ex: If the input is: 5 10 4 39 12 2 the output is: 39,12,10,4,2, For coding simplicity, follow every output value by a comma, including the last one. Your program must define and call the following function:void SortVector(vector<int>& myVec) #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() { /* Type your code here */ return 0;} Enter program input - 5 10 4 39 12 2arrow_forwardUsing c++ Reverse vector Complete Reverse() function that returns a new character vector containing all contents in the input argument reversed. Ex: If the input vector is: ['a', 'b', 'c'] then the returned vector will be: ['c', 'b', 'a'] #include <algorithm>#include <iostream>#include <vector>using namespace std; int main(){ // initializing the vector vector<char> vect = { }; // Printing the vector cout<<"Reversing a vector by using reverse iterators"<<endl; cout << "Vector: "; for (int i = 0; i < vect.size(); i++) cout << vect[i]; cout << endl; //reversing the vector vector<char> v2 (vect.rbegin(),vect.rend()); vect.swap(v2); // Printing the reversed vector cout << "Reversed Vector: "; for (int i = 0; i < vect.size(); i++) cout << vect[i]; cout << endl; return 0;}arrow_forward
- 6.Please_Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b): """Finds if `str_a` matches `str_b` Keyword arguments: str_a -- string str_b -- string. """.arrow_forwardC++ I need to create a function that manipulates a vector. Create a function insert_back(n, x, v) that adds n copies of integerx to the back of vector v. The argument v is a vector of integers.arrow_forwardHello C++ question thank you 1) Develop a function that properly prints out each element of a vector of strings Print an endline character when done to make sure the next print starts on a new line make this function templated to the vector type passed in(Comment this) 2) Implement the following functionality using std::vector and std::string data types: a vector that contains the following strings as elements { olleh ereht skool ekil uoy desrever gnihtyreve gnidrocca ot nalp doog boj } Print the vector using your function Reverse all the letters in each string, so that each string is now a proper word Print the vector using your function a second "new" vector, copying the first vector's elements using iterators Do not copy the first two elements and the last two elements into the new vector Print the "new" vector using your function Sort the "new" vector alphabetically Print the "new" vector using your function Change every 'o' character in the "original" vector into a '@'…arrow_forward
- In C++ This program will store roster and rating information for a soccer team. Coaches rate players during tryouts to ensure a balanced team. (1) Prompt the user to input five pairs of numbers: A player's jersey number (0 - 99) and the player's rating (1 - 9). Store the jersey numbers in one int vector and the ratings in another int vector. Output these vectors (i.e., output the roster). (2) Implement a menu of options for a user to modify the roster. Each option is represented by a single character. The program initially outputs the menu, and outputs the menu after a user chooses an option. The program ends when the user chooses the option to Quit. For this step, the other options do nothing. (3) Implement the "Output roster" menu option. Ex: ROSTER Player 1 -- Jersey number: 84, Rating: 7 Player 2 -- Jersey number: 23, Rating: 4 ... (4) Implement the "Add player" menu option. Prompt the user for a new player's jersey number and rating. Append the values to the two vectors. Ex:…arrow_forwardFind the Median without the High and Low Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.arrow_forwardCity and State. Extract the city name and state from strings like “Utica, NY” and “Los Angeles, CA”. Assume the state is always the last two characters in the string, the city name has at least one character, there is a comma following the city name, and a single space after the comma. Use the split method to separate the city name from the state (Notice the city name will still have a comma at the end). The following attachement is a sample execution:arrow_forward
- #include <iostream> #include <vector> using namespace std; // Define the chessboard size const int N = 8; // Define the starting and ending positions const pair<int, int> start = {1, 1}; const pair<int, int> end = {N, N}; // Define the number of moves const int numMoves = 4; // Define a vector to store generated sequences vector<vector<pair<int, int>>> sequences; // Define a function to recursively generate move sequences void generateMoveSequences(pair<int, int> currentPos, vector<pair<int, int>> currentSequence) { // Base case: if we've made all the required moves if (currentSequence.size() == numMoves) { if (currentPos.first == end.first && currentPos.second == end.second) { sequences.push_back(currentSequence); } return; } // Generate all possible next moves (horizontally or vertically) vector<pair<int, int>> possibleMoves = {{currentPos.first + 1, currentPos.second}, {currentPos.first,…arrow_forwardonsider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…arrow_forwardPYYTHON!!! Write a function str_replace that takes three strings, str1, str2 and str3; and replaces the first occurence (if any) of str2 in str1 with str3, and returns the newly formed string. For example, str_replace("Nuclear Energy Engineering", "Nuclear Energy", "Mechanical") returns "Mechanical Engineering" """arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning