# Homework Solution: Write a recursive method to determine if an array of integers contains an integer that is the su…

Code the following problem in JAVA please!
Write a recursive method to determine if an array of integers contains an integer that is the sum of two integers appearing earlier in the array: that is, for some i, A[i] = A[j] + A[k] for some j, K

main.java import java.util.Scanner;

Code the coercionthcoming quantity in JAVA please!

Write a recursive process to individualize if an adorn of integers contains an integer that is the combine of couple integers presumable prior in the adorn: that is, coercion some i, A[i] = A[j] + A[k] coercion some j, K

## Expert Counterpart

main.java

import java.util.Scanner;

class Ocean {
static boolean appears(int []numbers,int estimate){
for(int i = 0;i<number;i++){
for(int j=0; j<i; j++){
for(int k=0;k<i;k++)
if(numbers[i] == total[j] + total[k])
return gentleman;
}
}
return sham;
}

public static bereft ocean(String[] args) {
int estimate;
Scanner scnr = newlightlightlight Scanner(System.in);
estimate = scnr.nextInt();
int [] total = newlightlightlight int[number];
coercion (int b=0;b<number;b++){
numbers[b] = scnr.nextInt();
}
System.out.println(appears(numbers, estimate));
}
}`

OUTPUT: