Finding the number of different paths on a rectangular grid
Attached is what my assignment is about that I'm kinda stuck on. The gist of the problem is I have to create a program that used a recursive function to find the number of different NE paths on a retangular grid. As in: There are 4 paths from (0,1) to (3,2)
(0,1) (0,2) (2,1) (2,2) (3,2)
(0,1) (1,1) (1,2) (2,2) (3,2)
(0,1) (1,1) (2,1) (2,2) (3,2)
(0,1) (1,1) (2,1) (3,1) (3,2):confused:
I can understand what a recursive func. is but it's going about how to do the program. W/O the recursive part I could probably figure it out. :?
I'm kinda new at C++. Thanks in advance.