Consider the following program that attempts to locate an element x in a…

Consider the following program that attempts to locate an element x in a sorted array a[1..N] using binary search. Assume N > 1. The program is erroneous. Under what condition does the program fail?

i = 1;
j = N;
do {
   k = floor((i + j) / 2);
   if (a[k] < x)
       i = k + 1;
   else
       j = k;
} while (a[k] != x && i < j);

if (a[k] == x)
   print("x is in the array");
else
   print("x is not in the array");