数据结构练习（09）排序数组中和为给定值的两个数字

bool find2number(int data[], unsigned int len, int sum, int& num1, int& num2)
{
bool found = false;
if (len < 1)
return found;

int ahead = len - 1;
int behind = 0;

while (behind < ahead)
{
if (data[behind] + data[ahead] == sum)
{
num1 = data[behind];
num2 = data[ahead];
found = true;
break;
}
else if (data[behind] + data[ahead] > sum)
--ahead;
else
++behind;
}
return found;
}