4.11 LAB: 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& myVec) Hint: Sorting a vector can be done in many ways. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: https://en.wikipedia.org/wiki/Bubble_sort. But you are welcome to try others: https://en.wikipedia.org/wiki/Sorting algorithm. 467820.2656874.qx3zqy7 LAB ACTIVITY 1 #include 2 #include 3 using namespace std; 4 4.11.1: LAB: Sort a vector 5 /* Define your function here */ 6 7 int main() { 8 9 10 11} 12 /* Type your code here */ return 0; main.cpp 3/10 Load default template.

4.11 LAB: 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& myVec) Hint: Sorting a vector can be done in many ways. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: https://en.wikipedia.org/wiki/Bubble_sort. But you are welcome to try others: https://en.wikipedia.org/wiki/Sorting algorithm. 467820.2656874.qx3zqy7 LAB ACTIVITY 1 #include 2 #include 3 using namespace std; 4 4.11.1: LAB: Sort a vector 5 /* Define your function here / 6 7 int main() { 8 9 10 11} 12 / Type your code here */ return 0; main.cpp 3/10 Load default template.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.6: The Standard Template Library (stl)

Problem 8E

See similar textbooks

Similar questions

Write a function that adds the contents of two vectors using the following header: template<typename T>void addvector(vector<T> &v1, vector<T> &v2) Write a test program that reads in 6 int values in two vector, adds both and displays the result.
C++ 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 2
Part 2: Unroll Write a function called unroll, which takes in a square array of arrays (i.e. a grid with n rows and n columns). An input could look like this: const square = [ [1, 2, 3, 4], [5, 6, 7, 8], ]; [9, 10, 11, 12], [13, 14, 15, 16] unroll should take in such a square array and return a single array containing the values in the square. You should obtain the values by traversing the square in a spiral: from the top- left corner, move all the way to the right, then all the way down, then all the way to the left, then all the way up, and repeat. For the above example, unroll should return [1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10].
bool ok(int q[]) which takes an array q and returns true if the array represents a valid configuration of the eight queens and returns false otherwise. 4. Write a function
C++ 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.
Language: JVA Script Write a function 'morseCode' that takes an array containing a series of either 'dot' or 'dash' strings. Your function should console.log each string in order, followed by a pause of 100ms after each "dot and 300ms after each 'dash`. Example: let code= ['dot', 'dash', 'dot']; morseCode (code); // print 'dot' // pause for 100ms // print 'dash' // pause for 300ms // print 'dot' // pause for 100ms *************** function morseCode (code) { |// Your code here } ***DO NOT MODIFY ANYTHING UNDER THIS LINE*** try { | module.exports = morseCode; } catch { | module.exports = null; }
C++ Create a function append(v, a, n) that adds to the end of vector v a copy of all the elements of an 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 of integers and a is an array of integers. Write a test driver.
Function: randOps Input: (1xN double) A Vector of numbers (N>=2 and even) Output: (double) A number Function Description: Given a 1XN vector where N>=2 and even, perform the following random operations in the following order and return the resulting number 1. Extract all even indexed values into a vector and multiply them by 3 2. Extract all odd indexed values into a vector and divide by 5 3. Subtract the results of Step 2 from the results of Step 1. 4. Calculate the product of all the values contained in the vector result of Step 3. 5. Calculate the value needed to get the number from Step 4 to the next highest integer. 6. Round your result from Step 5 to 5 decimal places Hint(s): ▪ prod(), ceil() and round() may be Examples: ans1 = randOps ([2 5 4 1 3 4 2 1]) >>ans1 = 0.9632 ans2 = randOps ([3 6 2 5]) >> ans2 = 0.9600 ans3 = randOps ([30 40 10 20 50 80]) >> ans3 = 0
Write a findSpelling Function -PHP Write a function findSpellings($word, $allWords) that takes a string and an array of dictionary words as parameters. The function should return an array of possible spellings for a misspelled $word. One way to approach this is to use the soundex() Words that have the same soundex are spelled similarly. Return an array of words from $allWords that match the soundex for $word. I have most of the code. How do I append the $sound to the $mathcing array?
Part B:Given a vector of size S and a number N. Write a function that calculates if there isany pair of numbers in the vector whose sum is equal to N? Hint: you can use the binary search function you implemented in part A. Notes:You must use iterators in your implementation. Input Format:The input consists of 2 lines. The first line contains 2 numbers, S and N. The secondline contains S numbers which represent the contents of the vector. Input:3 53 1 2 Output:YES
Code in C. Solve the code below. Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". int busca_seq(int vetor[], int n, int b) { //your code } My Code #include<stdio.h> int busca_seq(int vetor[], int n, int b) { int i; for(i = 0; i < n; i++){ if(vetor[i] == b) return (i+1); } { int vet[5],n = 5,b,x; vet[0] = 1; vet[1] = 2; vet[2] = 3; vet[3] = 4; vet[4] = 5; scanf("%d",&b); x = busca_seq(vet,n,b); printf("%d",x); return 0; } }
3) Create a function named "makeThemOdd". The function should accept a parameter named "numberArray". Use the higher order function map() to create a new array that contains all the numbers from the original parameter array but adds 1 to each even number. The new array should only have odd numbers in it. Return the new array. // Use this array to test your function:const testingArray = [1, 2, 4, 17, 19, 20, 21];