Check whether there are two numbers in a
sorted array whose sum equals a given value
==============================================================
Let Array be
A[] = {1, 2, 8, 11, 15, 23, 46, 93, 108};
Let 57 be our required sum
beg=0
end=8
reqSum = 57
number1 = A[beg];
number2 = A[end];
do (Untill number1+number2 = reqsum)
{
if ((number1 + number2) > reqsum)
end--;
else if ((number1 + number2) < reqsum)
beg++;
}
==============================================================
Let Array be
A[] = {1, 2, 8, 11, 15, 23, 46, 93, 108};
Let 57 be our required sum
beg=0
end=8
reqSum = 57
number1 = A[beg];
number2 = A[end];
do (Untill number1+number2 = reqsum)
{
if ((number1 + number2) > reqsum)
end--;
else if ((number1 + number2) < reqsum)
beg++;
}
No comments:
Post a Comment