(Linear Search) Often, we are given a list of unsorted numbers and we would like to search for a given value, starting from the front of the list and stopping when we find the first instance. This is called linear search. lin_search Function: Input variables: • a vector of unsorted numbers representing the data to search • a scalar representing the item we wish to find Output variables: • a scalar representing the first location in the vector where the item was found; if the item is not found, return a -1 A possible sample case is: » loc = lin_search([1 1 4 2 3 5 2 3 4 5], 3) loc = 5 » loc = lin_search([1 1 4 2 3 5 2 3 4 5], 6) loc -1

(Linear Search) Often, we are given a list of unsorted numbers and we would like to search for a given value, starting from the front of the list and stopping when we find the first instance. This is called linear search. lin_search Function: Input variables: • a vector of unsorted numbers representing the data to search • a scalar representing the item we wish to find Output variables: • a scalar representing the first location in the vector where the item was found; if the item is not found, return a -1 A possible sample case is: » loc = lin_search([1 1 4 2 3 5 2 3 4 5], 3) loc = 5 » loc = lin_search([1 1 4 2 3 5 2 3 4 5], 6) loc -1

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

- in this exercise, please do not include and use string class. The function is using only array notation and manipulation.- string functions such as strlen is not allowed.- it should not have multiple return statements in the same function- there should be no global variable.- the function should not traverse the arrays more than once (e.g. looping through the array once only) A C++ PROGRAM named "changeCase" that takes an array of characters terminating by NULL character (C-string) and a boolean flag of toUpper. If the toUpper flag is true, it will go through the array and convert all lowercase characters to uppercase. Otherwise, it will convert all uppercase to lowercase. For example, if the array is {'H', 'e', 'l', 'l', 'o', '\0'} and the flag is true, then the array will become{'H', 'E', 'L', 'L', 'O', '\0'}. And if the flag is false, the array will become{'h', 'e', 'l', 'l', 'o', '\0'}
8. using c++, Write a function method that determines the mean of all the values in an array of integers. Your mean function should call a separate function that you write that determines the sum. Don’t use built-in sum or mean gadgets, but roll your own.
Derive the run time of the following code
(a) Write the C++ function, operator+(const Matrix& b) const, which returns the matrix *this + b.
7. using c++, Write a void function that accepts an integer array a and a integer SizeA, and an integer n, and adds n to every element in that array. Be sure to develop an appropriate name for your function.
Please use C++ and make sure it's for a sorted array Write a function, removeAt, that takes three parameters: an array ofintegers, the number of elements in the array, and an integer (say,index). The function should delete the array element indicated byindex. If index is out of range or the array is empty, output an appropriatemessage. (Note that after deleting the element, the number of elements inthe array is reduced by 1.) Assume that the array is sorted.
Use the eig function from the numpy linalg library in Python to get the eigenvalues and eigenvectors of a matrix. The eigenvalues and eigenvectors are provided as one eigenvector per column of a matrix, as can be seen in the code below. The matrix V contains one eigenvector for each column, and the eigenvalues of the matrix A are included in the vector w. The provided matrix A's determinant is the product of its Eigenvalues, which are 2, 1, and 4, and the trace of A is the same as the sum of those values.
Write a C++ function to find the norm of a matrix. The norm is defined as the square root of the sum of squares of all elements in the matrix Note: the use of pointers is not allowed and code should be simple.The user should input the matrix he wants.We cannot initialize the matrix on our own.
TROUBLESHOOTING: Fix the errors in the code below and run the script with your modified code function [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % Solves Ax = b by Gauss-Seidel method with relaxation. % USAGE: [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % INPUT: % func = handle of function that returns improved x using % x = starting solution vector % maxIter = allowable number of iterations (default is 500) % epsilon = error tolerance (default is 1.0e-9) % OUTPUT: % x = solution vector % numIter = number of iterations carried out % omega = computed relaxation factor if nargin < 4; epsilon = 1.0e-9; end if nargin < 3; maxIter = 500; end k = 10; p = 1; omega = 1; for numIter = 1:maxIter xOld = x; x = feval(func,x,omega); dx = sqrt(dot(x - xOld,x - xOld)); if dx < epsilon; return; end if numIter == k; dx1 = dx; end if numIter == k + p omega = 2/(1 + sqrt(1 - (dx/dx1)ˆ(1/p))); end end error(’Too many iterations’)
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)
-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'
NEED CODING IN PYTHON OR JAVASCRIPT BUT NOT C++ consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The…