Recursion FAIL

I'm learning to hate recursion terribly, but I need to do it for this project.
The point of the project is to go from pointA to pointB using recursion in java. And print out all paths.
my input is
5
3 0
1 3

output should be about 10 paths in form of (col,row)
can I get a few pointers and maybe a little help?
private void pathFinder(int row, int col, int xB, int yB, int[][] array)
{
    if(row==xB && col==yB)
    {
        System.out.println("("+row+","+col+") ");
    }
    if(canIGoNorth(row,xB)==true)
    {
        System.out.print("("+row+","+col+") ");           
        pathFinder(row-1,col,xB,yB,array);
        System.out.print("("+row+","+col+") ");
    }
    if(canIGoEast(col,yB)==true)
    {
        System.out.print("("+row+","+col+") ");           
        pathFinder(row,col+1,xB,yB,array);
        System.out.print("("+row+","+col+") ");
           
    }
       
       
    }
inb4 learn to code, everythings wrong, and java sucks.

>>9
you could avoid having a stack by keeping a sort of "next" pointer which allows you to traverse it sequentially in one way, but that just moves the cost of recursion from runtime to alloc time.
Yes, exactly! That's the whole point of the safety-critical guidelines.

Note that they don't abolish memory allocation; just *dynamic* memory allocation, i.e. allocation after program startup. That way a) you can give a formula for the program resource requirements based on its input, and b) if the program successfully starts, it can run indefinitely.

>>10
The point is to have statically calculable and provable resource requirements. Haven't you been paying attention?