Subject:
|
RE: Would-be hacker queries. (fwd)
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Tue, 11 May 1999 16:16:33 GMT
|
Original-From:
|
Jim Choate <ravage@STOPSPAMMERSeinstein.ssz.com>
|
Viewed:
|
707 times
|
| |
|
|
----- Forwarded message from Joel Shafer -----
Date: Tue, 11 May 1999 10:50:14 -0500
From: Joel Shafer <joel@connect.net>
Subject: 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.
----- End of forwarded message from Joel Shafer -----
This is iteration, not recursion. It can certainly be done recursively but
this description isn't. It's iterative because we do not require the finding
and changing of the n'th term to depend on the n-1'st term.
____________________________________________________________________
Three step plan: 1. Take over world. 2. Get lot's of cookies.
3. Eat the cookies.
Anonymous
The Armadillo Group ,::////;::-. James Choate
Austin, Tx /:'///// ``::>/|/ ravage@ssz.com
www.ssz.com .', |||| `/( e\ 512-451-7087
-====~~mm-'`-```-mm --'-
--------------------------------------------------------------------
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message has 1 Reply:
 | | RE: Would-be hacker queries. (fwd)
|
| I'm afraid you are wrong. That is exactly what it does. The result of the first replacement is dependent on the result of the second replacement which is dependant on the result of the third replacement ... It is exactly like the factorial example (...) (25 years ago, 11-May-99, to lugnet.robotics)
|
2 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
