-
The following function computes the maximum value contained in an integer array p[] of size n (n >= 1).
int max (int *p, int n){
int a = 0, b = n –1;
while (__________){
if (p[a]<= p[b]){a = a + 1;}
else {b = b – 1;}
}
return p[a];
}
The missing loop condition is
-
- a != n
- b != 0
- b > (a+1)
- b != a
- a != n
Correct Option: D
P[a] will have the maximum value of the array, when a = b.