Write a function that gets an array as a parameter (address and size) and a number and checks to see if that number exists in the array. The function should report every single occurrence of the number in the array. It should also report how many occurrences were detected in total (use c code) Suggested prototype: void findnReport(int* ar, int size, int num) Example of function output: If array = {2,5,3,5,12,13,14,15,0,5,-1,11,5} and num = 5, Number 5 found in array index 1 Number 5 found in array index 3 Number 5 found in array index 9 Number 5 found in array index 12 Total of 4 occurrences of number 5

Write a function that gets an array as a parameter (address and size) and a number and checks to see if that number exists in the array. The function should report every single occurrence of the number in the array. It should also report how many occurrences were detected in total (use c code) Suggested prototype: void findnReport(int* ar, int size, int num) Example of function output: If array = {2,5,3,5,12,13,14,15,0,5,-1,11,5} and num = 5, Number 5 found in array index 1 Number 5 found in array index 3 Number 5 found in array index 9 Number 5 found in array index 12 Total of 4 occurrences of number 5

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

Write a function that will combine two arrays of different lengths into another array. Express the function's running time in terms of actual running time and Big-Oh notation. For reference, this is the function declaration: void combine(int* comb_arr, int* arr1, int n, int* arr2, int m) where comb_arr- the array used to combine arr1 and arr2 arr1 - the first array n - the length of the first array arr2 - the second array m - the length of the second array INITAL CODE TO BE COMPLETED #include <iostream>using namespace std;void combine(int*, int*, int, int*, int); int main(void) { // Hey there, start typing your C++ code here... int size1, size2; cin >> size1; int arr1[size1]; for (int i = 0; i < size1; i++) { cin >> arr1[i]; } cin >> size2; int arr2[size2]; for (int i = 0; i < size2; i++) { cin >> arr2[i]; } int comb_size = ___; int comb_arr[comb_size]; combine(comb_arr, arr1, size1, arr2, size2);…
Write a function, remove, that takes three parameters: an array of integers, the number of elements in the array, and an integer (say, removeItem). The function should find and delete the first occurrence of removeItem in the array. (Note that after deleting the element, the number of elements in the array is reduced by 1.) Assume that the array is unsorted. Also, write a program to test the function. Your program should prompt the user to enter 10 digits for the array. Display the starting array to the user and prompt them to select an integer to remove. After the selected integer has been removed, the updated list should be displayed to the user. If the value does not exist or the array is empty, output the following message: x is not in the list
Write a function that gets an array as a parameter, sorts it in an ascending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). Use c code int sortASC(int* myArray, int size) if array ={ 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array)
Hello, I am having trouble with this homework question for my course for intro to c++. Topic is on Array 2 Write a function definition for a function named getLast which does the following: 1) Accepts the array, size of the array and value as parameters. 2) Returns the last index of a value in an integer array. If the value does not exist in the array, return -1. Example Given the array {3, 6, 8, 3, 2, 6}. Given the value 6, this function getLast returns the value 5 which is the last index of 6 in the array.
(C language) Write a function intersect() that takes five arguments: an array of integers, number of elements in this array, a second array of integers, number of elements in the second array, a third array as parameters; finds the numbers in the first array that also exist in the second array and places these numbers into the third array; returns the number of matching values stored in array-3. Prototype: int intersect(int ar1[], int n1, int ar2[], int n2, int ar3[]) ps: please do not copy paste from chegg or anywhere else. write a unique code.
You’re writing a function in C++ that accepts an array of distinct integers from 0, 1, 2, 3...up to N. However, the array will be missing one integer, and your function is to return the missing one. For example, this array has all the integers from 0 to 6, but is missing the 4: [2, 3, 0, 6, 1, 5] Therefore, the function should return 4. The next example has all the integers from 0 to 9, but is missing the 1: [8, 2, 3, 9, 4, 7, 5, 0, 6] In this case, the function should return 1. Using a nested-loops approach would take up to O(N^2). Your job is to optimize the code so that it has a runtime of O(N).
In C++, Can you please look at the code below and revise/fix so it will work according to instructions and criteria. Instruction 1) Write a function that copies a 1D array to a 2D array. The function’s prototype is bool copy1DTo2D(int d1[], int size, int d2[][NCOLS], int nrows); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant size = NCOLS * nrows the function returns true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and 2d array indices is 2d row index = 1d array index / NCOLS 2d column index = 1d array index modulus operator NCOLS 2) Write a function that copies a 2D array to a 1D array. The function’s prototype is bool copy2DTo1D(int d2[][NCOLS, int nrows, int d1[], int size); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant the function return true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and…
Write the appropriate function definition for each of the following situations: b) Write a function that computes two sums from the elements of an array of integers. Each element of the array contributes to one of the two sums, depending on whether the element itself is even or odd. Your function definition should look like this:void sum(int x[ ]){ int n;int sum_even;int sum_odd;::}
C++ Write a function SwapArrayEnds() that swaps the first and last elements of the function's array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. Use this code: #include <iostream>using namespace std; /* Your solution goes here */ int main() { const int SORT_ARR_SIZE = 4; int sortArray[SORT_ARR_SIZE]; int i; int userNum; for (i = 0; i < SORT_ARR_SIZE; ++i) { cin >> userNum; sortArray[i] = userNum; } SwapArrayEnds(sortArray, SORT_ARR_SIZE); for (i = 0; i < SORT_ARR_SIZE; ++i) { cout << sortArray[i] << " "; } cout << endl; return 0;}
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.
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.
Write a function intersect() that takes five arguments: an array of integers, number of elements in this array, the second array of integers, number of elements in the second array, the third array as parameters; finds the numbers in the first array that also exist in the second array and places these numbers into the third array; returns the number of matching values stored in array-3. Prototype: int intersect(int ar1[], int n1, int ar2[], int n2, int ar3[])