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 / *11551 (+10)
  A recursion question/test...
 
Hi, With all the discussion on understanding recursion and such for programmers I thought I'd share a little problem I find enlightening.... Describe as simple a recursive algorithm as possible for summing the first n numbers. ___...___ Three step (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
(...) d'oh. my ($n)=@ARGV; my $result=$n; $result += $n while($n--); print $result."\n"; What a difference a compile makes... but it's still not very recursive. I'll be interested in seeing your answer. Aloha, JR - - - - - - - - - - JR Conlin (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Unsubscribe
 
Please unsubscribe me from the handy board mailing list. Alex Novaes (28 years ago, 12-May-99, to lugnet.robotics.handyboard)
 
  Re: A recursion question/test...
 
Jim Choate poses the problem: (...) What other than sum(n) = n + sum(n-1) (with proper termination conditions, of course - sum(1) = 1). Ralph deal@kzoo.edu -- Did you check the web site first?: (URL) (28 years ago, 12-May-99, to lugnet.robotics)
 
  You know, all this computer science talk doesn't really belong here.
 
Try lugnet.off-topic.geek. :) (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Scheme (fwd)
 
On Tue, 11 May 1999, Jim Choate wrote: . . . (...) More details: In 1966, work began on LOGO at Bolt, Beranek, & Newman. The team was headed by Wally Fuerzeig and included Seymour Papert who later wrote the text which popularized LOGO: MindStorms. (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: NQC 1.3 released - Command Center?
 
(...) I assume you meant "RcxCC". Last I heard from Mark, it will be "soon". I'm pretty sure you can just replace nqc.exe and rcx.nqh in RcxCC with the 1.3 versions. There won't be templates/hilighting for any new commands, but at least you will be (...) (28 years ago, 12-May-99, to lugnet.robotics.rcx.nqc)
 
  Re: Fishing for a tasty linkage/gearing/robotic building thread...
 
Me too !! Kipling Morris wrote in message ... (...) against (...) I (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test... (correction)
 
Whoops! I typed the last two lines with the two aggregate operators interchanged! Obviously they should have read FUNCTION sum(n: natural): natural = SUM [0..n] FUNCTION fac(n: natural): natural = PRODUCT [1..n] Malcolm -- Did you check the web site (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
It should be pointed out that the problem of summing the first n natural numbers is isomorphic to that of finding the factorial of n. Compare these two functions FUNCTION sum(n: natural): natural = IF n = 0 THEN 0 ELSE n + sum(n - 1) FUNCTION fac(n: (...) (28 years ago, 12-May-99, to lugnet.robotics)

Next Page:  5 more | 10 more | 20 more
Redisplay Messages:  All | Compact

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