Question

please write this code in c++

// a: an array of ints. size is how many ints in array 7/ Return the largest value in the list. 7/ This value may be unique, or may occur more than once // You may assume size >= 1 int largestValue(int *a, int size) { assert(size >= 1); return -42; // STUB !!! Remove and replace with correct code 71 a: an array of ints. size is how many ints in array 7/ Return the smallest value in the list. // This value may be unique, or may occur more than once // You may assume size >= 1 int smallestValue(int *a, int size) { assert(size >= 1); return -42; // STUB !!! Remove and replace with correct code 11 a: an array of ints. size is how many ints in array 1/ Return the sum of all the elements in the array 11 size may be o in this case, or non-zero. int sum(int *a, int size) { return -42; // STUB

Answer 1

#include <iostream>

using namespace std;

--------------------------------------------------------------------------------------------------------------------

int largestValue(int *a, int size){

int max = a[0];

for(int i=1 ; i<size; ++i){

if(a[i] > max)

max = a[i];

}

return max;

}

--------------------------------------------------------------------------------------------------------------------

int smallestValue(int *a, int size){

int min = a[0];

for(int i=1 ; i<size; ++i){

if(a[i] < min)

min = a[i];

}

return min;

}

--------------------------------------------------------------------------------------------------------------------

int sum(int *a, int size){

int ans = 0;

for(int i=0 ; i<size; ++i){

ans = ans + a[i];

}

return ans;

}

--------------------------------------------------------------------------------------------------------------------

int main() {

int a[] = {3,4,12,67,0};

cout << largestValue(a,5)<<endl;

cout << smallestValue(a,5)<<endl;

cout << sum(a,5)<<endl;

}

------------------------------------------------------------------------

SEE Output as methods were tested

Files : main.cpp saved https://CreativeChartreuse Opens main.cpp 18 19 return min; } clang version 7.0.0-3-ubun al) > clang++-7 -pthread -o ma 3./main 67 int sum(int *a, int size) { int ans = 0; for(int i=0; i<size; ++i) { ans = ans + a[i]; return ans; } int main() { int a[] = {3,4,12,67,0}; cout << largestValue(a,5)<<endl; cout << smallestValue(a,5)<<endl; cout << sum(a,5)<<endl; } 31 33

mins int largestValue(int *a, int size) { int max = a [0]; for(int i=1 ; i<size; ++i) { if(a[i] > max) max = a[i]; return max; 19 11 12 13 14 int smallestValue(int *a, int size) { int min = a[0]; for(int i=1 ; i<size; ++i) { if(a[i] < min) min = a[i]; 15 16 17 18 return min; a 20 21 22 int sum(int *a, int size) { int ans = 0; for(int i=0; i<size; ++i) { ans = ans + a[i]; 23 24 25 return ans; 27

--------------------------------------------------------------------------------------------------------------------

PLEASE COMMENT if there is any concern.

==============================