Subject:
|
RE: Would-be hacker queries. / Re: Request for new list
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Mon, 10 May 1999 21:44:05 GMT
|
Original-From:
|
Blake Winton <blake.winton@pcdocs.%Spamcake%com>
|
Viewed:
|
2929 times
|
| |
|
|
> Eric Lind wrote:
> > recursion - the process of one function calling itself to solve a problem.
> > This is done by breaking the problem down to its smallest size, then • combining
> > the smaller solutions. Factorials are usually used as a simple example of
> > recursion. 6! = 6*5*4*3*2*1. One can repeatedly break the factorial down
> > until you reach 1, then recombine the problem to find the final solution.
You might want to add the recursive part of this example
(namely 6! = 6*(5!), and 5! = 5*(4!), and so on,
until you get 1!, which is equal to 1. Then you travel
back up the chain, multiplying as you go).
Later,
Blake.
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message has 4 Replies:
 | | Scheme
|
| Anyone consider scheme as a "language" to drive RCX? -- Richard Clemens Associate Professor Computer Science Department West Virginia Wesleyan College Buckhannon, West Virginia 26201 clemens@wvwc.edu 304.473.8421 -- Did you check the web site (...) (27 years ago, 11-May-99, to lugnet.robotics)
| | | RE: Would-be hacker queries.
|
| (...) problem. (...) 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 (...) (27 years ago, 11-May-99, to lugnet.robotics)
| | | Re: Scheme
|
| Could you give a brief description of scheme? I've heard that it is a fairly high level language and I know that a compiler or interpreter exists for it on linux. (...) -- Did you check the web site first?: (URL) (27 years ago, 11-May-99, to lugnet.robotics)
|
11 Messages in This Thread:
 
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
