number of paths in a matrix from top left to bottom right

#include using namespace std; 

int numPathsInMatrix(int m, int n) 

{

 if(m==1 || n==1) return 1; 

return numPathsInMatrix(m-1, n) + numPathsInMatrix(m, n-1); 

}

 int main() { 

// your code goes here cout << numPathsInMatrix(4,4); 

return 0; 

}