10.排序数组中和为给定值的两个数字

///////////////////////////////////////////////////////////////////////
// Find two numbers with a sum in a sorted array
// Output: ture is found such two numbers, otherwise false
///////////////////////////////////////////////////////////////////////
bool FindTwoNumbersWithSum
    (
    int data[],           // a sorted array
    unsigned int length,  // the length of the sorted array     
    int sum,              // the sum
    int& num1,            // the first number, output
    int& num2             // the second number, output
    )
{

    bool found = false;
    if(NULL==data || length < 1)
        return found;

    int right = length - 1;
    int left = 0;

    while(left<right)
    {
        long long curSum = data[left] + data[right];

        // if the sum of two numbers is equal to the input
        // we have found them
        if(curSum == sum)
        {
            num1 = data[left];
            num2 = data[right];
            found = true;
            break;
        }
        // if the sum of two numbers is greater than the input
        // decrease the greater number
        else if(curSum > sum)
            right --;
        // if the sum of two numbers is less than the input
        // increase the less number
        else
            left ++;
    }

    return found;
}