Looking for algoritm to the partition problem C

[transgalactic]

write a function called

 int partition(int arr[], int size)

which input an array of integers and decides whether
it is possible to divide the array into two groups
so the sums of both the groups will be equal.

for example arr = {1,2,2,3,5,6,1}
its could be divided into {2,2,6}  and {1,1,3,5} both of their sums is 10

so they are equal and the function needs to return 1.

the function must be recursive without loops.
you are allowed to use only one external recursive function

and i can't use pointers
i tied to build a code that sums for ranges
but the example shows that there could be a possibility
of two sub sequences mixed with one another
so the range option is not solving this

??

 

[Potential]

Why does the method have to be recusive? Why can't you use pointers?

 

[mgb_phys]

Because CS homework always involves recursion - CS teachers still thinks it's cool.
Fortunately almost all CS grads remember nothing they have learned so don't try and use it in the real world.

 

[Potential]

Well then, a little more coded form would help understand the task at hand. For example, since no references or pointers are allowed, how do you intend to retain a calculated value between calls...a member variable or possibly a static or global variable, or are these off limits also?