Tomás Ó hÉilidhe wrote:

> Salt_Peter <(E-Mail Removed)> wrote 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

(E-Mail Removed)