4. Given the main function, write a function maxRow that passes in a 2D array, rows and cols. Which returns the row with the most positive numbers. Use the following main function: int main() { int x[3][5] = {{-1, -2, 1, -3, 5}, {-5, -6, -4, -7, -8}, {-3, 5, -4, 3, 8) }; cout << maxRow(x, 3, 5) << endl; return 0; Output: 2.

4. Given the main function, write a function maxRow that passes in a 2D array, rows and cols. Which returns the row with the most positive numbers. Use the following main function: int main() { int x[3][5] = {{-1, -2, 1, -3, 5}, {-5, -6, -4, -7, -8}, {-3, 5, -4, 3, 8) }; cout << maxRow(x, 3, 5) << endl; return 0; Output: 2.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 3PP: (Numerical) Given a one-dimensional array of integer numbers, write and test a function that...

See similar textbooks

Similar questions

Now, write another function that prints the values of any array in reverse order. (The function should not change the original array). As an example, if a [] = {1, 2, 3, 4, 5}; The function would print the values in reverse as: 5, 4, 3, 2, 1
Write a function that returns an integer that appears most often with respect to an array of integers In the array. for example. [1 2 3 2 3 4 2 5] For an array your function must return 2.
Write a function ProductMax2() that will take an array as argument andcomputes the product of two maximum numbers in the array. Make sure youdo not use Array subscript notation to iterate over the array.
Python Coding Exercise: Write a function that takes three parameters: a 2-D array arr, a row location i, a column location j and returns a float representing the fraction of neighbors around arr [i,j] # write your function here:def find_frac(arr,i,j):
//Required Functionvoid func(int array_1[],int array_2[],int size){ for(int i=0;i<size;i++){ if(array_2[i]>array_1[i]){ array_1[i]=array_2[i]; } } return;} //main function to test the function.int main(){ int size=6; int a[]={1,5,9,8,7,6}; int b[]={1,4,10,12,7,15}; printf("First array before function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } func(a,b,size); //call to the created function printf("\nFirst array after function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays
Write a function that takes 3 arguments, all integers. // It returns an array starting with the first number and increasing by the interval until it reaches // the second number, including the second number if it is part of the pattern. // For this exercise you can assume that the first integer is strictly less than the second integer. const countWithIntervals = (start, end, interval) => { } // Examples countWithIntervals(1, 10, 2) // returns [1, 3, 5, 7, 9] countWithIntervals(5, 20, 3) // returns [5, 8, 11, 14, 17, 20] // Write a function that takes 2 arguments, both strings. // It returns as a number how many times the second string occurs within the first string. const subStringCount = (string, subString) => { } // Examples subStringCount("mississippi", "i") // returns 4 subStringCount("lions and tigers and bears", "and") // returns 2
Answer in java script Create a function that returns true if the first array can be nested inside the second. arr1 can be nested inside arr2 if: 1. arr1's min is greater than arr2 's min. 2. arr1's max is less than arr2 's max. Examples canNest([1, 2, 3, 4], [0, 6]) true canNest ([3, 1], [4, 0]) → true canNest ([9, 9, 8], [8, 9]) → false canNest([1, 2, 3, 4], [2, 3]) - false
Code for this in C: You have created three arrays:array A of size 100array B of size 50array C of size 200You are to store the first 100 numbers (1,2,3,...,100) into array A, the first 50 positive odd numbers (1,3,5,...,) into array B, and the reciprocal of each position [C(5) = 1/5] into array C. Then, output the contents of each array.
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
Write a program which should consists of a user defined function “maximum ()”. Pass 1D array to the function, along with number of elements of array. Find out the maximum element in 1D array using this function.[Note: Array should be passed using by reference approach] C language
Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks
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];