Write a function that returns a pointer to the maximum value of an array of double values. if the array is empty, return null. double* maximum(double *a, int size) { }

double* maximum(double *a, int size) {

if(size == 0)

return NULL;

int i;

double max = 0.0;

double *mp;

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

if(a[i] > max){

max = a[i];

mp = &a[i];

}

}

return mp;

}

Explanation:

You iterate through the vector and find the maximum value. You go updating the pointer throughout the loop. I am going to write a C function

double* maximum(double *a, int size) {

if(size == 0)

return NULL;

int i;

double max = 0.0;

double *mp;

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

if(a[i] > max){

max = a[i];

mp = &a[i];

}

}

return mp;

}

answer

it would be true.

ok that sounds like a app that my brother would like