Subject:
|
Re: A recursion question/test...
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Wed, 12 May 1999 05:29:28 GMT
|
Original-From:
|
Ralph M. Deal <deal@kzoo[NoSpam].edu>
|
Viewed:
|
482 times
|
| |
|
|
Jim Choate poses the problem:
> 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.
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?: http://www.crynwr.com/lego-robotics
|
|
Message is in Reply To:
 | | 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 (...) (25 years ago, 12-May-99, to lugnet.robotics)
|
7 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
