To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.roboticsOpen lugnet.robotics in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 Robotics / 4981
4980  |  4982
Subject: 
RE: Would-be hacker queries.
Newsgroups: 
lugnet.robotics
Date: 
Tue, 11 May 1999 14:43:35 GMT
Original-From: 
JR Conlin <jrconlin@email.comSTOPSPAM>
Viewed: 
791 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.
 
(...) The factorial is useful for probability. The factorial is a simple, understandable example of recursion, useful to teach the concept; it is lacking only in that it is not very efficient. But when you are first learning, I think concepts are (...) (25 years ago, 11-May-99, to lugnet.robotics)

Message is in Reply To:
  RE: Would-be hacker queries. / Re: Request for new list
 
(...) combining (...) 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 (...) (25 years ago, 10-May-99, to lugnet.robotics)

11 Messages in This Thread:




Entire Thread on One Page:
Nested:  All | Brief | Compact | Dots
Linear:  All | Brief | Compact

This Message and its Replies on One Page:
Nested:  All | Brief | Compact | Dots
Linear:  All | Brief | Compact
    

Custom Search

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR