Interview Question for Senior Software Engineer at Salesforce.com:

I would start my first pointer at the 0 index of the array, subtract that number from the given sum and store this number in a temp. I would then have a second pointer traverse the array until I found a number equivalent to the temp (only walking while the number was less than what is in temp because its an ordered array), store the two indices, and since this is an ordered array i would continue to walk this second pointer down the array until the number was no longer equivalent to temp. If no number was found before the end of the array or a number greater than temp was found, then increment the first pointer and continue the loop process until the end of the array is reached by the first pointer.