****Do all problems in C++. Any problem that uses the java.util.*, cstring, or string library will get 0 credit.

Given an array A of n arbitrary integers, write an O(n)-time method for finding an integer that cannot be formed as the sum of two integers in A.

In your comments write runtime and algorithmic approximation for each problem.