The following function computes the maximum value contained in an integer array p[ ] of size n (n >= 1).
int max(int*p,intn) {
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 is1
a ! = n
2
b ! = 0
3
b > (a+1)
4
b ! = a