what is recursion in c++.

[athar.mirchi]

..plz define it.

[=?utf-8?B?RGF2aWQgQ8ODxpLDgsK0bWU=?=]

On Sat, 05 Jan 2008 20:17:17 +0100, at**********@gm ail.com
<at**********@g mail.comwrote:

.plz define it.

RTFM !
Google is not dead !

[Tomás Ó hÉilidhe]

"at**********@g mail.com" <at**********@g mail.comwrote in comp.lang.c++:

.plz define it.

Mainly "recursion" is where a function calls itself. Something like:

long unsigned Factorial(unsig ned const input)
{
if (0 == input) return 1;

if (1 == input) return input;

return input * Factorial(input - 1);
}

--
Tomás Ó hÉilidhe

[Mark]

On 2008-01-05 19:17:17 +0000, "at**********@g mail.com"
<at**********@g mail.comsaid:

.plz define it.

http://en.wikipedia.org/wiki/Recursion

[Salt_Peter]

On Jan 5, 2:17 pm, "athar.mir...@g mail.com" <athar.mir...@g mail.com>
wrote:

.plz define it.

As the English word suggests: a recursion is simply a function that
calls itself.
Which is neither efficient nor beneficial.
Each call generates a new local stack which eventually all need to be
unwound.
So in C++, its usually replaced with better alternatives.
An example of a preferred alternative would then be a function object
(functor).
Recursive functions have no state (what does that mean?).

To give you an example of recursion:
(that incidentally doesn't do what you'ld expect)

#include <iostream>

void recursion(int n)
{
std::cout << "n = ";
std::cout << n << std::endl;
if(n < 10)
recursion(++n);
}

int main()
{
recursion(0); // prints 11 times
}

[Salt_Peter]

On Jan 5, 2:23 pm, David Côme <davidc...@wana doo.frwrote:

On Sat, 05 Jan 2008 20:17:17 +0100, athar.mir...@gm ail.com

<athar.mir...@g mail.comwrote:

.plz define it.

RTFM !
Google is not dead !

And neither is a little respect.
Some come here hoping others do their homework,
others prefer to ask rather than remain clueless.
Some of those know very little English.

So please: if you feel the need to reply with a patronising remark,
consider ignoring them, redirecting them to Wikipedia/Google or offer
them a link to the FAQ.

[douggunnoe]

On Jan 5, 2:19*pm, Salt_Peter <pj_h...@yahoo. comwrote:

On Jan 5, 2:17 pm, "athar.mir...@g mail.com" <athar.mir...@g mail.com>

Each call generates a new local stack which eventually all need to be
unwound.
So in C++, its usually replaced with better alternatives.

I agree. But my old college professors thought it was great.

And personally, I also find it more difficult to debug.

[=?utf-8?Q?David_C=C3=B4me?=]

On Sat, 05 Jan 2008 21:41:38 +0100, Salt_Peter <pj*****@yahoo. comwrote:

On Jan 5, 2:23 pm, David Côme <davidc...@wana doo.frwrote:

>On Sat, 05 Jan 2008 20:17:17 +0100, athar.mir...@gm ail.com

<athar.mir...@ gmail.comwrote:

.plz define it.

RTFM !
Google is not dead !

And neither is a little respect.
Some come here hoping others do their homework,
others prefer to ask rather than remain clueless.
Some of those know very little English.

So please: if you feel the need to reply with a patronising remark,
consider ignoring them, redirecting them to Wikipedia/Google or offer
them a link to the FAQ.

You could have a basic question because everybody has been noob when he
started programmation.
Howerver before ask usenet,forums.. . you must make some research.

And recursion on google was the fisrt link so....

[Tomás Ó hÉilidhe]

Salt_Peter <pj*****@yahoo. comwrote in comp.lang.c++:

As the English word suggests: a recursion is simply a function that
calls itself.
Which is neither efficient nor beneficial.

It's great though for template metaprogramming . For instance:

template<long unsigned x>
struct Factorial {
static long unsigned const val = x * Factorial<x-1>::val;
};

template<>
struct Factorial<1{
static long unsigned const val = val;
};

template<>
struct Factorial<0{
static long unsigned const val = 1;
}
--
Tomás Ó hÉilidhe

[Jim Langston]

Tomás Ó hÉilidhe wrote:

Salt_Peter <pj*****@yahoo. comwrote in comp.lang.c++:

>As the English word suggests: a recursion is simply a function that
calls itself.
Which is neither efficient nor beneficial.

It's great though for template metaprogramming . For instance:

template<long unsigned x>
struct Factorial {
static long unsigned const val = x * Factorial<x-1>::val;
};

template<>
struct Factorial<1{
static long unsigned const val = val;
};

template<>
struct Factorial<0{
static long unsigned const val = 1;
}

recursion [ri-kur'zhen] - (n) see recursion

--
Jim Langston
ta*******@rocke tmail.com