import java.util.*;

public class Total
{
    public Total (Vector<Integer> list)
    {
        _numbers = list;
    }

    public Integer[] sum (int total)
    {
        Integer[] toReturn = new Integer[2];
        boolean found = false;

        for (int i = 0; (i < _numbers.size()) && !found; i++)
        {
            // recurse
        }

        return null;
    }

    private Vector<Integer> _numbers;
}
@@ -321,30 +321,410 @@
     
-// recurse%0A        %7D%0A%0A
+toReturn%5B0%5D = _numbers.elementAt(i);%0A%0A            for (int j = i; (j %3C _numbers.size()) && !found; j++)%0A            %7B%0A                if (toReturn%5B0%5D + _numbers.elementAt(j) == total)%0A                %7B%0A                    toReturn%5B1%5D = _numbers.elementAt(j);%0A%0A                    found = true;%0A                %7D%0A            %7D%0A        %7D%0A%0A        if (found)%0A            return toReturn;%0A        else%0A    
     

Update Total.java