Subject:
|
RE: Would-be hacker queries.
|
Newsgroups:
|
lugnet.off-topic.fun
|
Date:
|
Tue, 11 May 1999 22:31:59 GMT
|
Viewed:
|
162 times
|
| |
|
|
In lugnet.robotics, JR Conlin writes:
> > > Eric Lind wrote:
> > > > recursion - the process of one function calling itself to solve a
> > > > problem.
> >
> > You might want to add the recursive part of this example
> > (namely 6! = 6*(5!), and 5! = 5*(4!), and so on,
>
> You know, I have never really liked the factorial example of recursion.
> Honestly, how many times have you really needed to generate a factorial in
> general experience?
Oh, I dunno, maybe about 3! or 4! times...
--Todd
|
|
Message has 2 Replies:
 | | Re: Would-be hacker queries.
|
| (...) Time for a maths-B@SED gag. dy/dLehman = Todd Lehman y = ½Todd Lehman² also d²y/dLehman² = Lehman OK, work out the binomial expansion of (1 + ToddLehman) This'll teach you for being clever. (26 years ago, 11-May-99, to lugnet.off-topic.fun)
|
3 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
