Reduce function in Racket?

Question

I'm stuck 5 days with this task in Racket, does anybody know how can I approach it?

Given a function of arity 2 and a list of n elements, return the evaluation of the string function of all the elements, for example:

>(reduce + '(1 2 3 4 5 6 7 8 9 10))

55

> (reduce zip '((1 2 3) (4 5 6) (7 8 9)))
'((1 (4 7)) (2 (5 8)) (3 (6 9)))

The sample output doesn't seem right, please check to see if it's correct. Also, post the implementation of `zip`. — Óscar López, Feb 10 '14 at 21:41

GoZoner · Answer 1 · 2014-02-15T19:10:54.593

12

Here you go.

(define (reduce func list)
  (assert (not (null? list)))
  (if (null? (cdr list))
      (car list)
      (func (car list) (reduce func (cdr list)))))

Tests:

> (reduce + '(1 2 3 4 5 6 7 8 9 10))
55
> (reduce zip '((1 2 3) (4 5 6) (7 8 9)))
((1 (4 7)) (2 (5 8)) (3 (6 9)))

For completeness, an implementation for zip (one that assumes two lists and that your lists are all the same length) is:

(define (zip l1 l2) (map list l1 l2))

edited Feb 15 '14 at 19:10

answered Feb 10 '14 at 22:34

GoZoner

Ouch, hit by a sniper. Down voted w/o an explanation - on a CORRECT answer no less. Bring it on! – GoZoner Feb 12 '14 at 00:04
2

you're right, the answer seems correct. here ya go. :) Why ppl in [tag:scheme] don't upvote each other, I don't understand it. It's not like we have a large audience here. Could you show the definition of `zip` through? Or are you using a built-in? (well, obviously it's `(define (zip a b) (map list a b))`, but for the sake of completeness it should be inside the answer perhaps). – Will Ness Feb 15 '14 at 17:57
Thanks. The same user asked a question on implementing `zip`. See http://stackoverflow.com/questions/21688944/zip-function-in-racket-scheme – GoZoner Feb 15 '14 at 18:34
1

already did. :) this was assumed to be homework, so giving full code isn't advisable... :) ... so you mean you're using same `zip` here as you gave there? still perhaps it's better to include the code (or its skeleton) here as well. (?) – Will Ness Feb 15 '14 at 18:47

Jack · Answer 2 · 2016-03-07T04:06:14.713

9

You can express it in terms of foldl:

(define (reduce f xs)
  (and (not (empty? xs)) (foldl f (first xs) (rest xs))))

edited Mar 07 '16 at 04:06

answered Aug 08 '14 at 20:06

Jack

score 2 · Answer 3 · edited Jan 15 '17 at 22:24

2

(define reduce
  (λ (f init ls)
    (if (empty? ls)
        init
        (reduce f (f init (first ls)) (rest ls)))))

edited Jan 15 '17 at 22:24

Baum mit Augen

answered Jan 15 '17 at 08:25

abcd

3 Answers3