Chapter 3, Problem 17C

Explanation of Solution

Algorithm:

indicesSearcher(A, i)

// if after entire array traversal two valid integers are not returned, then condition is false or, there is no such integers or indices j and k such that A[i] = A[j] + A[k] for the given value of i

if i <= 1

// if i = 1, only 1 element at index 0 is present in the array, hence condition not valid

return 0, 0 else

for j = 1 to i - 1

for k = 0 to j – 1

// if the condition is valid, return j and k satisfying the condition

if A[j] + A[k] = A[i]

return j, k

// recursive calling of the same function with the same array and the index i subtracted by 1

return indicesSearcher(A, i - 1)

Explanation:

The above algorithm is used to check if an array “A” of integers contains an integer “A[i]” that is the sum of two integers that appear earlier in “A”, that is, such that “A[i] = A[ j] +A[k]” for “j,k < i”...