GATE | GATE-CS-2014-(Set-3) | Question 65
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order.
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
Which one of the following statements about the function ProcessArray is CORRECT?
(A) It will run into an infinite loop when x is not in listA.
(B) It is an implementation of binary search.
(C) It will always find the maximum element in listA.
(D) It will return −1 even when x is present in listA.
The function is iterative implementation of Binary Search. k keeps track of current middle element. i and j keep track of left and right corners of current subarray