Re: Increasing the stack?
From: bm (behzad_mortazavi_at_hotmail.com)
Date: 11/04/03
- Previous message: lostone: "Re: Need Help with Simple programs"
- In reply to: Stewart Gordon: "Re: Increasing the stack?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 04 Nov 2003 12:47:58 GMT
"Stewart Gordon" <smjg_1998@yahoo.com> wrote in message
news:bo84kr$fpv$1@sun-cc204.lut.ac.uk...
>
>
> While it was 3/11/03 8:15 pm throughout the UK, bm sprinkled little
> black dots on a white screen, and they fell thus:
> <snip>
> > Though there exists many types of recursion, all recursions require a
base
> > case for the recursion to cease and start to unwind. Similar to
recursions
> > there are many different types of iterative methods. In the simplest
case,
> > a while(true) loop which you can not be converted to recursion.
>
> So something like this
>
> void hellos() {
> System.out.println("Hello, infinite recursion");
> hellos();
> }
>
> isn't a recursion?
I guess your comments are fair, because I didn't explain myself well.
Recursive functions are not made by simply calling oneself. You
need to have a stop condition also to cease the recursion and have
the chance to unwind the recursive calls. Your program will also stop
because of limited amount of memory. But that is not why it can not
be considered recursive theoratically.
- Previous message: lostone: "Re: Need Help with Simple programs"
- In reply to: Stewart Gordon: "Re: Increasing the stack?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|