If I had a N lists each of length M, how could I write a nice clean function to return a single list of length M, where ea开发者_C百科ch element is the sum of the corresponding elements in the N lists
I have the following items (define itemslist (list \'a1 \'b2 \'c3 (list \'z1 \'z2) \'d5 \'e6)) My method to find items is below
I\'m going through the \"Little Schemer\" book, and doing the various functions.Generally I end up with the same version as the books, but not for eqlist?, which is a function to test the equality of
Consider this bit of Chez Scheme code: (import (chezscheme)) (define (list-enumerate ls val开发者_如何学JAVA proc)
(define (Int开发者_如何学编程egral f a b N) ;define h as a constant (let((h (/ (- b a) N)))) (define (Term n)
I am trying to add a matrix and it is not working... (define (matrix-matrix-add a b) (map (lambda (row) (row-matrix-add row b))
Exercise 1.11: A function f is defined by the rule that f(n) = n if n < 3 and f(n) = f(n - 1) + 2f(n- 2) + 3f(n - 3) if n > 3. Write a procedure that computes f by means of a recursive process
Isn\'t it possible to treat functions in Scheme as any other list? Basically, what开发者_开发知识库 I want do to is something like this:
Now I research OOP-part of Scheme. I can define class in Scheme like this: (define (create-queue) (let ((mpty #t)
How to write a program in scheme that takes an arbitrary sexpression consisting of integers and which returns an sexpression that is identical to
加载中,请稍侯......