Chapter 4, Problem 59C

Explanation of Solution

Algorithm to find the number that is not formed by sum of two integers in A:

//Sort the array of integers

Sort(A)

number = 1

//Execute the for loop from 1 to length

For i from 1 to length(A):

/* If the current number is greater than the smallest number*/

  if A[i]>number:

  //Return the number

  return number

  else:

  //Add the value of number with current number

  number = number + A[i]

//Return the number

return number

Explanation:

• Initially assign the smallest number as “1”.
• Then from the array take the initial value and check the condition whether the value from the first index is less than the number...