CHALLENGE 6.11.5: Modify a vector parameter. ACTIVITY Write a function SwapVector Ends() that swaps the first and last elements of its vector parameter. Ex: sortVector = {10, 20, 30, 40} becomes (40, 20, 30, 10). 406554.2871636.qx3zqy7 1 #include 2 #include 3 using namespace std; 4 5* Your solution goes here */ 6 7 int main() { 8 9 10 11 12 13 14 15 vector sortVector (4); unsigned int i; int userNum; for (i = 0; i < sortVector.size(); ++i) { cin>> userNum; sortVector.at (i) = userNum;

CHALLENGE 6.11.5: Modify a vector parameter. ACTIVITY Write a function SwapVector Ends() that swaps the first and last elements of its vector parameter. Ex: sortVector = {10, 20, 30, 40} becomes (40, 20, 30, 10). 406554.2871636.qx3zqy7 1 #include 2 #include 3 using namespace std; 4 5* Your solution goes here */ 6 7 int main() { 8 9 10 11 12 13 14 15 vector sortVector (4); unsigned int i; int userNum; for (i = 0; i < sortVector.size(); ++i) { cin>> userNum; sortVector.at (i) = userNum;

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 18SA

See similar textbooks

Similar questions

In c++ please Write the RemoveEvens() function, which receives a vector of integers as a parameter and returns a new vector of integers containing only the odd numbers from the original vector. The main program outputs values of the returned vector. Hint: If the original vector has even numbers, then the new vector will be smaller in length than the original vector and should have no blank element. Ex: If the vector passed to the RemoveEvens() function is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the function returns and the program output is: [1, 3, 5, 7, 9] Ex: If the vector passed to the RemoveEvens() function is [1, 9, 3], hen the function returns and the program output is: [1, 9, 3] #include <iostream>#include <vector>using namespace std; vector<int> RemoveEvens(vector<int> nums) { /* Type your code here */} int main() { vector<int> input(9); input.at(0) = 1; input.at(1) = 2; input.at(2) = 3; input.at(3) = 4; input.at(4) = 5;…
In c++ iv read from a text file containing integers Example 11,1 22, 3 12, 4 And stored each colum in a vector vectorx and vectory How can i make a class for x integers and class for y integers I will use this classes to compare these x and y integers
Implement the following function without using any additional data structure, and without sorting the input vectors. /* Given two vectors of integers, check if the two vectors contain same set of values: e.g., V1=[3,4,10,4,10,11] and V2=[3,3,4, 11, 10] stores same set int: {3, 4, 10, 11}. Note that duplicates are removed when considering set */ @param list1, list2: two vectors of integers@pre: list1, list2 have been initialized@post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */ bool SameSet (const vector<int> & list1, const vector<int> & list2) {//for each value in list1, check if it appears in list2, if not, return false //for each value in list2, check if the value appears in list1, if not return false //return true}
Create a function append(v, a, n) that adds to the end of vector v a copy of all the elements of array a. For example, if v contains 1,2, 3, and a contains 4, 5, 6, then v will end up containing 1, 2, 3, 4, 5,6. The argument n is the size of the array. The argument v is a vector ofintegers and a is an array of integers. Write a test driver.
Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linkedlist. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If nosuch element exists, output an appropriate message. Provide the definitions of these functions in the class linkedListType. Also writea program to test these functions. (Use either the classunorderedLinkedList or the class orderedLinkedList to testyour function.) Note: Code in c++
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…
Consider the following function main:int main(){int alpha[20];int beta[20];int gamma[4] = {11, 13, 15, 17};int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11, 1, 8};. . .}a. Write the definition of the function setZero that initializes any one-dimensional array of type int to0.b. Write the definition of the function inputArray that prompts the user to input 20 numbers and storesthe numbers into alpha. Ex-10 ENGR2217 SP20c. Write the definition of the function doubleArray that initializes the elements of beta to two timesthe corresponding elements in alpha. Make sure that you prevent the function from modifying theelements of alpha.d. Write the definition of the function printArray that prints any one- dimensional array of type int.Print 15 elements per line.
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 using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
In C++: 1) Write a printRange function which prints all values of an unsorted array (smallest to largest) between A and B inclusive. This function should accept all required data as parameters.ExamplesIf the array is 25 8 13 5 27 6 72 48, A is 20 and B is 40, this function prints 25 27.If the array is 10 1 28 42 18 34 100 125, A is 8 and B is 32, this function prints 10 1 28 18.
C++ please help I will give you a good rating!!!!! Implement the following function that returns a vector of vectors of Item, each of which is a subset of elements chosen from the given vector a[first…last]: /* if a is {1,2,3}, first=0, last=2, the function shall returns a vector of the following vectors: {}, {1}, {2}, {3}, {1,2},{1,3}, {2,3},{1,2,3}, all subsets of a[0…2]. Precondition: last-first+1>=1, i.e., there is at least one element in the a[first…last] Note 1)if the length of a[first…last] is n, then the function should return a vector of 2n vectors 2) The order of these subsets does not need to match what’s listed here… */ vector<vector<int>> subsets (const vector<int> & a, int first, int last) CODE: #include <iostream> #include <algorithm> #include <vector> using namespace std; void PrintVector (const vector<int> & v){ cout <<"["; for (auto e:v){ cout<<e<<" "; } cout <<"]"; } /*…
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
4.4.1: Modify an array parameter. Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}.