Question

Let 'a' be an array containing n integers in increasing order. The following algorithm determines whether there are two distinct numbers in the array whose difference is a specified number S > 0

i = 0; j = 1;
while (j < n)
{
if (E)
j++;
else if (a[j] — a[i] = = S)
break;
else
i++;
}
if (j < n)
printf("yes");
else
printf ("no");

Choose the correct expression for E.

• A. a[j] - a[i] < S
• B. a[j] - a[i] > S
• C. a[i] - a[j] < S
• D. a[i] - a [j] > S

Answer 1

The correct option is A a[j] - a[i] < S

x

y

i j

So, if conditions will check a[j] - a[i] < S then increment j so that difference between two elements increase and when a[j] - a[i] > S then increment i for making difference between two element indexed at i and j respectively is decrease.

So, a[j] - a[i] < S is correct condition.