Problem 1: Given an increasingly sorted array and a number s, please find two numbers whose sum is s. If there are multiple pairs with sum s, just output any one of them. For example, if the inputs are an array { 1 , 2 , 4 , 7 , 11 , 15 } and a number 15, please out two numbers 4 and 11 since 4+11=15. Analysis: Let us firstly have a try to select two numbers (denoted as num1 and num2) of the input array. If their sum equals to s, we are fortunate because the required numbers have been found. If the sum is less than s, we may replace num1 with its next number, because the array is increasingly sorted and its next number should be greater. If the sum is greater than s, num2 can be replaced with its previous number in the sorted array, which should be less than num2. Take the array { 1 , 2 , 4 , 7 , 11 , 15 } and number 15 as a...