 | | Re: Scheme
|
|
A simple scheme interface such as (sensor <num> <type> <mode>) or (motor <letter> <direction> <speed>) could prove a valuable addition to scheme teaching functions. Students could explore functions (i.e. just small "programs") to include the ability (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test...
|
|
(...) Well, you didn't specify if the numbers existed in a list or were iterative, and you didn't specify language so: Smalltalk: ^list sum. or ^(1..n) sum. sorry.. if you'll excuse Perl... List: foreach $num (@list) {$result += $num;} return (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test...
|
|
(define (sum num) (if (zero? num) 0 (+ num(sum (- num 1))))) -- Richard Clemens Associate Professor Computer Science Department West Virginia Wesleyan College Buckhannon, West Virginia 26201 clemens@wvwc.edu 304.473.8421 ----- Original Message ----- (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
(...) Let me say that I have not looked at the algorythm in question, yet, so forgive me if this is their solution... (...) The SmalltalkVM my last company built used much the same idea, however, one might say that it was a truely recursive (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
(...) Actually, he goes on to show that in some cases you can eliminate call stack recursion using simple transforms as well. (...) For example, JVM does this by keeping a frame stack of methods that have been executed. The interpreter main loop (...) (28 years ago, 11-May-99, to lugnet.robotics)
|