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.

>>39
Brilliant! I'll just deliver an error message when users attempt to open files over 640kB in size, even though they have 8GB of memory.
What the fuck dude, nice strawman. I am talking about safety-critical software here. I never said you should obey these guidelines for your fucking word processor. But you should absolutely obey a similar set of guidelines to land a plane. Simply hoping you've reserved enough stack space for your recursion in that scenario is insanity.

recursion for gomosexualistos

any recursion programm my be overwriten without recursion with saving a memory

>>41
So you use a language designed for recursion that doesn't increase stack requirements with each function call.

>>43
Surely nothing like this can exist!!!

FORTRAN 77 doesn't have recursion.  Is FORTRAN 77 a bad language?

>>45
FORTRAN77 the best language

>>43
No. In such languages, only tail recursion doesn't increase stack requirements, and in this case the language isn't giving you much because you could easily convert it to a looping function by hand.

The idea that Scheme makes any recursion magically better is false, and the practical difference between a tail-recursive function and a looping one is insignificant; consider it a little syntactic sugar. Scheme is a particularly bad choice for safety-critical code because you can't reliably reason about its performance characteristics.

the language isn't giving you much because you could easily convert it to a looping function by hand
Yes rewriting code and maintaining clarity is trivial.

>>41
I am talking about safety-critical software here.
Precisely. I wasn't going to point it out and let to try to dodge.

>>47
Of course you can. Just print out a function trace :D

Recursion FAIL
Regress to /b/, please.

Newer Posts

---

Don't change these.

Name:		Email:
Entire Thread Thread List