# Re: SQL (was: Why using "Group By")

From: Bob Badour <bbadour_at_golden.net>

Date: Sat, 15 Mar 2003 02:50:52 -0500

Message-ID: <GpBca.81$vG5.8551456_at_mantis.golden.net>

Date: Sat, 15 Mar 2003 02:50:52 -0500

Message-ID: <GpBca.81$vG5.8551456_at_mantis.golden.net>

"Mikito Harakiri" <mikharakiri_at_yeehu.com> wrote in message
news:rOAca.107648$6b3.328547_at_rwcrnsc51.ops.asp.att.net...

> "Bob Badour" <bbadour_at_golden.net> wrote in message

*> news:eNzca.78$Yp5.7615634_at_mantis.golden.net...
**> > Since A(n,m) = n + m + 1 | ( n in Integer, m in Integer, n >= 0, m >=
*

0 ),

> > why do we need recursion for this function?

*>
**> A(2,2)=7
**>
**> (see for example http://www.nyx.net/~fbrosson/ack/ )
**>
**> while
**>
**> 2+2+1 = 5
*

D'Oh! Okay, I agree that we need recursion. You have me convinced. Received on Sat Mar 15 2003 - 08:50:52 CET