Implement the following function, without using any data structure. /* Given two vectors of chars, check if the two vectors are permutations of each other, i.e., they contains same values, in same or different order. e.g., V1=[‘a’,’b’,’a’] and V2=[‘b’,’a’,’a’] stores same multi-set of data points: i.e., both contains two ‘a’, and one ‘b’. e.g., V3=[‘a’,’c’,’t’,’a’] and V4=[‘a’,’c’,’t’] are not same multi-set. V3 contains two ‘a’s, while V4 has only one ‘a’. Note: when considering multiset, the number of occurrences matters. @param list1, list2: two vectors of chars @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 SameMultiSet (vector list1, vector list2)

Implement the following function to sort the columns in a two-dimensional array. A new array is returned. The original array is intact. const int SIZE = 3;void sortColumns(const double m[][SIZE], double result[][SIZE]); Write a test program that prompts the user to enter a 3 * 3 matrix of double values and display a new column-sorted matrix.

Im having trouble with this Lab for my computer science class. 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)

can you write in C++

Write a function max_matrix(M) that takes in a non-empty matrix (a 2-dimensional array) of real numbers M and returns its maximum value. You must use loops in your code. In python

Write a function that accepts a number, N, and a vector of numbers, V. The function will return two vectors which will make up any pairs of numbers in the vector that add together to be N. Do this with nested loops so the the inner loop will search the vector for the number N-V(n) == V(m). n and m are indices in the vector of numbers. Example A = [1,2,3,4,5,6, 7] Google(5, A) Return [1,2,3,4] and [4,3,2,1] being the pairs that sum to 5. Notice that each pair appears twice. Try to write code that does not do this.

Help Please I am trying to solve this

Declare a vector of 15 doubles. Using a loop, set all the elements of your vector to 140.041. Write a function named print Vector that returns nothing and takes by constant reference a vector of doubles. The function should print every element of the vector, followed by a newline. Use this function to print out your vector from Assignment 1 above. Using the at() function, change the value of the first two elements to -1.0. Using the push_back () function to add two new elements at the end of the vector with values -10.3 and -20.3. Now use the sort () function on the vector. Using your function from Assignment 2, print the vector. Write a program that takes keyboard input from a user and puts what they type into a string. Print out the number of characters they just typed. Change the first character of the string to 'x'. Now append "<- you typed this!" to the string. Now print the modified string with cout. Caign Declare a vector of 5 strings. In a loop, read from the keyboard into each...

Write a function maxSpan(vector) measures the span between the smallest and largest integers in an array. For instance, if the smallest was 3 and the largest was 5, then the span would be 3 (that is the numbers 3,4,5). You cannot use a loop; you must use the algorithms from the STL. #include <vector>#include <algorithm>using namespace std; int maxSpan(const vector<int>& v){ .......... }

Exercise Write a C++ program that reads a maximum of 100 integers from the keyboard, stores them in a long array, sorts the integers in ascending order, and displays sorted output. Input can be terminated by any invalid input, such as a letter. HINT: Use the bubble sort algorithm to sort the array. This algorithm repeatedly accesses the array, comparing neighboring array elements and swapping them if needed. The sorting algorithm terminates when there are no more elements that need to be swapped. You use a flag to indicate that no elements have been swapped. Example of bubble sort algorithm: Original array: 100 50 30 70 40 After the first loop: 50 30 70 40 || 100 largest element T After the second loop: || 30 50 40 70 100 second largest element

1. The sorted values array contains 16 integers 5, 7, 10, 13, 13, 20, 21, 25, 30,32, 40, 45, 50, 52, 57, 60. Indicate the sequence of recursive calls that are made tobinaraySearch, given an initial invocation of binarySearch(32, 0, 15).show only the recursive calls. For example, initial invocation is binarySearch(45,0,15)where the target is 45, first is 0 and last is 15.

Can you help me write a C++ program to do the following: 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

ASSIGNMENT: Working with Vectors Write a menu-driven program that will allow the user to run any of the following questions. Please put the functions headers in h file and the functions definitions in a .cpp file. 1. Write C++ code for a loop that simultaneously computes both the maximum and minimum element in a given vector. 2. Write a function double scalar_product(vector a, vector b) that computes the scalar product of two vectors. The scalar product of two vectors A[al, a2, a3) and B(bl, b2, b3} is another vector C given by C{c1, c2, c3} where cl = al * b1, c2 = a2 + b2, c3 = a3 + b3. 3. Write a function that computes the alternating sum of all elements in a vector. For example, if alternatingSum() is called with a vector containing 149 16 9 7 4 9 11 then it computes 1-ひく4+たす9-ひく16+たす9-ひく7+たす4-ひく9+たす11=わ-ひく2 4. Write a procedure reverse that reverses the sequence of elements in a vector. For example, if reverse is called with a vector containing 1 49 16 9 7 4 9 11 then the vector is changed 11 9 4 7...