Hi, I'm having some trouble with a recursive function.
The function is written in C++.
The function is suppose to tell you how many paths there are on a grid. You are only allowed to move north and east. So say that the finishing cordinates are x=3,y=1 and the starting point is x=0,y=0. When using recursion, it will tell you how many paths there are(in this case 4). I managed to get the function to tell me how many paths there are in the function, but I'm totally out of ideas on how to print the individual paths(one path being NEEE,another EENE) and so on. I've included the code for my function. Thank you for your time.
 int path(int maxEast,int maxNorth)

{

int r1;

int r2;


if((maxEast > 3)  (maxNorth > 1))

{

return 0;

}


if((maxEast==3) && (maxNorth==1))

{

return 1;

}


r1=path(maxEast+1,maxNorth);

r2=path(maxEast,maxNorth+1);


return(r1+r2);

}