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.

I'm learning to hate recursion terribly
Wut. Don't be a fag. Recursion is a natural product of having functions.

Anyway, I have no idea what problem you're trying to solve, but I can tell you that you probably want to do nested if/else. You just enumerate (on a piece of paper) every case you need to test for, then arrange the nested conditionals (because your language sucks and doesn't have cond) to test for them in whatever order you see fit. The way you've done it, after going North you'll try to go East, creating a branching tree of function calls, while you're trying to produce a simple iteration.