hi
i got this question , int values[] int index int amount i need to check if there is sum of elementv in values that equal to amount
example
values[]={5,22,13,5,7,-4}
amount=31
22+13+(-4)=31
return true
the signature fo function call in recursion is:
cover (int[] values,int i,int amount)
henvertis, you hijack someone else's thread to post your "question". I suggest you to create a thread of your own and tell you that it might be a good idea to post the code you're working on because just posting a description of the problem might result into other forum members assuming you just want someone to do it for you (some call this cheating).
You then create a new thread, but (again) just with the problem description. I respond to that thread but you never got back to me, and now you're back again with another new thread and again just the problem description!
What's wrong with you?
