Q85

MCQ2 marks, −0.5

Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i, j, k; i= 0; j = 9; do { k = (i + j) / 2; if( Y[k] < x) i = k;else j = k; } while (Y[k] != x) && (i < j)) ; if(Y[k] == x) printf(" x is in the array ") ; else printf(" x is not in the array ") ; } The correction needed in the program to make it work properly is

(A)

Change line 6 to: if $(Y[k] < x) i = k + 1$ ; else $j = k-1$ ;

(B)

Change line 6 to: if $(Y[k] < x) i = k - 1$ ; else $j = k +1$ ;

(C)

Change line 6 to: if $(Y[k] < x) i = k$ ; else $j = k$ ;

(D)

Change line 7 to: } while $((Y[k] == x) \&\& (i < j))$ ;

Loading…