Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. 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
    1. a != n
    2. b != 0
    3. b > (a+1)
    4. b != a
Correct Option: D

P[a] will have the maximum value of the array, when a = b.



Your comments will be displayed only after manual approval.