Non Recursive calls store the local variables and stuff in stack
whereas in recursive calls the return addresses and the local variables for
each call are stored as stack frames with frame pointers and stack pointers.
On Thursday, September 1, 2011, teja bala wrote:
> @priya
> stack is a non recursive version of a recursion.....
> eg:-
> fac(int x)
> {
> f1( )//non recursive call ~= recursive indirectly
> {
> if(x>0)
> {
> fac(x--);//recursive call
> }
> }
> }
>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to
> algogeeks@googlegroups.com<javascript:_e({}, 'cvml',
> 'algogeeks@googlegroups.com');>
> .
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com <javascript:_e({}, 'cvml',
> 'algogeeks%2bunsubscr...@googlegroups.com');>.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Rajeev N B <http://www.opensourcemania.co.cc>
"*Winners Don't do Different things , they do things Differently"*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
