Create a vector (name the vector as "A") with random 12 values from the interval [1, 40] and use for loop to find the greatest element of the vector (name the element as maxA). Then, use while loop to find the smallest element of the vector (name the element as minA). Define a vector B, where B is the vector A sorted in descending order. Define a vector C, where C is the vector A sorted in ascending order. For the results (output) show the vectors A, B, C, maxA, and minA. [20 points]

Create a vector (name the vector as "A") with random 12 values from the interval [1, 40] and use for loop to find the greatest element of the vector (name the element as maxA). Then, use while loop to find the smallest element of the vector (name the element as minA). Define a vector B, where B is the vector A sorted in descending order. Define a vector C, where C is the vector A sorted in ascending order. For the results (output) show the vectors A, B, C, maxA, and minA. [20 points]

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

numStudents is read from input as the number of input values in the vector that follow. Use two for loops to output all numStudents elements of vector walkingLogs that are: even integers • odd integers ● For both loops, follow each element with a space, including the last element, and end with a newline. Ex: If the input is 8 11 30 70 39 69 29 138 162, then the output is: 30 70 138 162 11 39 69 29 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 12 13 14 15 16 17 18 19} int numStudents; int i; cin >> numStudents; vector walkingLogs (numStudents); for (i = 0; i > walkingLogs.at(i); } * Your code goes here */ return 0; ►
Create a vector x with the elements: O, 1/2, 2/3, 3/4, 4/5,...
2. Replace the even locations in the vector m= [7 9 2 4 5 8 10 3] with the following set of elements [1036 7] Your answer
To compute the average of the squares of the elements of a vector V, aka the mean square, we (Note: use randn to create a random vector) Select one: a. We use polyfit which does least squares and skip the minimization part b.we use sum(V.^2)./length(V*V) c.we use sum(V.*V)/length(V) d.we use mean(V) e.we use sum(V^2)/length(V)
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
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…
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; } }
Code in C. Solve the code below. write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int busca_bin (int vetor [ ], int n, int b){ #include <stdio.h> int busca_bin(int vetor[] , int n , int a) {    int s1 = 0; int s2 = n-1; int pass = 0; int s3;        while(s1<s2)     {         s3 = (s1+s2)/2;         pass++;…
Code in C. Solve the code below. write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int busca_bin (int vetor [ ], int n, int b){// your code} My code #include <stdio.h> int busca_bin(int vetor[] , int n , int a) {        int s1 = 0;     int s2 = n-1;    int pass = 0;     int s3;            while(s1<s2)     {…
Python Let x be a vector. How do you use rotate(deg) to find a vector y that is normal to x? Namely <x,y> = 0.
we can not use vector
Write a version of the binary search algorithm that can be used to search a string vector object. Also, write a program to test your algorithm. (Use the selection sort algorithm you developed in Programming sort the vector.)