Code snippet for recursive solution

poss_path.c

int PossiblePaths(int i,int j, int m, int n){
        if(i > m || j > n) return 0; 

        if(i == m && j == n) return 1;

        return PossiblePaths(i+1,j, m,n) 
              + PossiblePaths(i, j+1, m,n) 
              + PossiblePaths(i+1, j+1,m,n);
}