/**

@input A : Integer array

@input n1 : Integer array’s ( A ) length

@input B : Integer

@Output Integer
/
int diffPossible(int A, int n1, int B) {
int i=0;
int j=n11;
while(i>j)
{
if((A[j]A[i])==B)
return 1;
if((A[j]A[i])<B)
i++;
if((A[j]A[i])>B)
j–;}
return 0;
}