The programming language is C++.help me write a program. Lab8: Vector mergeCS-1022020 Fall SemesterE6.20 (Big C++ Chapter 6 - Arrays & Vector Exercise E6.20)Write a functionvector merge_sorted(vector a, vector b)that merges two sorted vectors, producing a new sorted vector. Keep an index into each vector,indicating how much of it has been processed already. Each time, append the smallestunprocessed element from either vector, then advance the index.For example, if a is0 1 49 16 25 36and b is4 5 8 13 20then merge_sorted returns the vector0 1 4 4 5 8 9 13 16 20 25 36Test cases:o Assign int value 0 1 4 9 16 25 36 to vector a (7) using a for loop where thevalue is the product of the index. For example:For ( index = 0; index < a.size (); index ++)a[index] = index * index;cout << a[index] << “ “;}O Assign int value 4 5 8 13 20 to vector b (4) using a for loop where the valueis the the current for loop index * index + 4 (see example above). For example, ifindex is 0:0 * 0 + 4 = 4; if index is 1 then 1 * 1+ 4 = 5; if index is 2 then 2 * 2 + 4 = 8o After you call the function:vector < int > c = merge_sorted (a, b);vector c would have the following value:0 14 4 5 8 9 13 16 20 25 36 Your program output should be similar to below.Vector a:e 1 4 9 16 25 36Vector b:4 5 8 13 20Result of interleaved merge of sorted a and b ise 1 4 4 5 8 9 13 16 20 25 36Lab Submission: See the lab submission requirements published in canvas.To submit your assignment in canvas, you must submit TWO files (one pdfand one zip) as follows:1. Attach pdt file which contains source codes you have written and program outputscreenshot so I can easily read in one file. You can use a word editor to place all the requiredprograms and screenshots, and then use 'Print' to 'Microsoft Print to PDF' to save to a pdf filePrintCopiesPrintPrinterMicrosoft Print to PDFReadyThe pdf file MUST have the following sections (1. Program Description, 2. Program SourceCode and 3. Program Output).1. Program Description• brief description of the purpose of the program andan explanation of what your software does and what problem it solves2. Program Source Code

Solution: Approach: Include necessary header files Define a function MergeSortedVetor() that takes…

Lab8: Vector merge CS-102 2020 Fall Semester E6.20 (Big C++ Chapter 6 – Arrays & Vector Exercise E6.20) Write a function vector merge_sorted(vector a, vector b) that merges two sorted vectors, producing a new sorted vector. Keep an index into each vector, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either vector, then advance the index. For example, if a is 0 1 49 16 25 36 and b is 4 5 8 13 20 then merge_sorted returns the vector 0 1 4 4 5 89 13 16 20 25 36

Lab8: Vector merge CS-102 2020 Fall Semester E6.20 (Big C++ Chapter 6 – Arrays & Vector Exercise E6.20) Write a function vector merge_sorted(vector a, vector b) that merges two sorted vectors, producing a new sorted vector. Keep an index into each vector, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either vector, then advance the index. For example, if a is 0 1 49 16 25 36 and b is 4 5 8 13 20 then merge_sorted returns the vector 0 1 4 4 5 89 13 16 20 25 36

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 24SA

See similar textbooks

Similar questions

Complete the following function that counts the even numbers in a 2D vector of integers. int count_evens(const std::vector<std::vector<int>>& v) { // Add your code... } Please add output screenshot!
You may insert an element into an arbitrary position inside a vector using an iterator. Write a function, insert(vector, value) which inserts value into its sorted position inside the vector. The function returns the vector after it is modified. #include <vector>using namespace std; vector<int>& insert(vector<int>& v, int value){ ................ return v; }
1.append(dynamic array, new element): function sent to itself Adds the element sturct to the end of the array inside DynamicArray. Place If not, it behaves in accordance with the dynamic array definition given above. 2. get(index): The element in the index sent to it by the function takes it from the array it hosts and sends it back. Array inside dynamic array when the existing array is full and a new element needs to be added will double its size, keep all the elements of the old array the same will copy the indexes and add the element to the new array. According to the definition of this problem, write the appropriate program in C programming language using the above functions. Do not use a linked list.
In PYTHON  Define a vector of integers with 5 elements  Write the following function  Given a vector and two indexes, returns a vector where the values at the provided indexes are swapped  Example Input: my_vector = [40,51,62,73,84,95]  Invokefunction:swap(my_vector,2,4)  Output:[40,51,84,73,62,95]
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++ Write a function call X that receives two arguments: an array of vectors (generic type) and a generic variable called Y. The function returns the index of the vector (.e. the index of the vector in the array of vectors) that has the highest occurrence of the item. The function returns -1 if the element Y is not found on any vector.
C++ Help Integers are read from input and stored into a vector until 0 is read. Output the elements from index n to the last index of the vector, where n is specified by the vector's last element. End each number with a newline. Ex: If the input is 7 12 18 2 0, the vector's last element is 2. Thus, the output is: 18 2 Note: The input has at least three integers, and the vector's last element is always less than the vector's size. #include <iostream>#include <vector>using namespace std; int main() { vector<int> intVect; int value; int i; int n; cin >> value; while (value != 0) { intVect.push_back(value); cin >> value; } // insert code here return 0;}
Consider the following code snippet: vector num (3) ; num [0] = 1; num [1] = 2; num [2] = 3; num.pop_back(); Which element or elements of the vector are removed by the pop_back() function in the given code snippet? The element with index 0 The element with index 1 The element with index 2 All the elements
Q/ write Matlab code that asks the user to enter several (elements (N) in Vector (V) -: uses (input) then ask the user to enter the values of elements of the vector: use (inputting) Note 1. Write the code in the matlab 2. Complete the execution and take pictures of the execution 3. Type (or copy and paste the code in the window for the problem one here
Use iterators to print each element of v separted by spaces. #include <iostream>#include <vector> using namespace std; int main(){vector<int> v = {1, 3, 5}; (.....) }
Write a function SwapVectorEnds() that swaps the first and last elements of its vector parameter. Ex: sortVector = {10, 20, 30, 40} becomes {40, 20, 30, 10}. #include <iostream>#include <vector>using namespace std; /* Your solution goes here */ int main() { vector<int> sortVector(4); unsigned int i; int userNum; for (i = 0; i < sortVector.size(); ++i) { cin >> userNum; sortVector.at(i) = userNum; } SwapVectorEnds(sortVector); for (i = 0; i < sortVector.size(); ++i) { cout << sortVector.at(i) << " "; } cout << endl; return 0;}
Use iterators to add up all of the numbers in a vector<double>. #include <vector>using namespace std; double accumulate(const vector<double>& v){ (...) }