Subject:
|
RE: Would-be hacker queries.
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Tue, 11 May 1999 14:46:20 GMT
|
Original-From:
|
JR Conlin <JRCONLIN@EMAIL.COMspamcake>
|
Viewed:
|
670 times
|
| |
|
|
At 05:44 PM 5/10/99 -0400, Blake Winton wrote:
>
> > 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?
I feel a better example is building stuff with LEGO. In this case, you are
the function and the LEGO is the data.
The basic function you perform is sticking blocks together. So to build a
rocket ship, you first need to attach the body to the engine. To build the
engine you need to attach the intake to the exhaust, and so on. As you
progress, you may be generating very complex items, but you are still
performing the same basic action, attaching one block to another.
Aloha,
JR
- - - - - - - - - -
JR Conlin jrconlin@email.com
Techno-Athiest yahooPage: jrconlin
<http://home.earthlink.net/~jrconlin>
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message has 1 Reply:
 | | RE: Would-be hacker queries.
|
| Searching and replacing is a good example of recursion. Suppose that you are editing a document and want to replace every occurrence of the word "the" with the word "then". Here is one way that the program could handle it. Function (...) (25 years ago, 11-May-99, to lugnet.robotics)
|
21 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
