Problem with recursive use of arrays.

Hey guys I'm new to this forum. I'm a student studying comp sci in university and I'm in my 2nd year. I currently have a problem where I need to create a recursive method that accepts an array of positive integers and checks if there is at least one value that is the sum of any 2 values that appear previously.

Example: Array[1,2,5,3,6] would be true because 1+5 = 6.

Array[1,6,2,5,4] would be false.

I'm not asking for code, only suggestions on how I should go about doing it. I'm having a hard time wrapping my brain around recursion, though I understand the concept, I have difficulty solving problems using recursive functions.

Thanks in advance!