C++ Create a function set(v, i, j) that makes vector v contain the integers i through j. The original contents of v is deleted. The vector is left empty if j < i. The argument v is a vector of integers

//   Description: Write a function Partition (f, l, p, a) //                which partitions array a into two parts, left and right. //                Elements of a in the left part should be smaller than p, //                and the elements of a great than or eqaul to p should be in the right part. //                F should set to the first element of a partition of array a to be partioned, //                and l is the left element of a to be subjected to the partition.   In C++ please, must include partition and swap functions

please help me with coding

need help in C++ Problem: You are asked to create a program for storing the catalog of movies at a DVD store using functions, files, and user-defined structures. The program should let the user read the movie through the file, add, remove, and output movies to the file. For this assignment, you must store the information about the movies in the catalog using a single vector. The vector's data type is a user-defined structure that you must define on functions.h following these rules: Identifier for the user-define structure: movie. Member variables of the structure "movie": name (string), year (int), and genre (string). Note: you must use the identifiers presented before when defining the user-defined structure. Your solution will NOT pass the unit test cases if you do not follow the instructions presented above. The main function is provided (you need to modify the code of the main function to call the user-defined functions described below). The following user-defined functions are…

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}; (.....) }

c++

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; }

3. Use two vectors and make them into one. Use the following vectors:Vector#1 {1, 1, 5, -3, 0}Vector#2 {9,7,2}Return a vector containing 1, 1, 5, -3, 0, 9, 7, 2 (in that order)

Complete the function: bool search(vector<int> v, int key). This function searches for value key in vector v and return true if key is found else return false.   In C++

C++.Write a function, named SecondNegative, that takes a const reference to a vector of doubles, it should return an const_iterator to the element in the vector that is the second value that is negative. If no such element exists, have the iterator point to one past the end.