Scheme/DrRacket Help

Does anyone know how to do this using one of these: filter, map, foldr? We're not allowed to use recursion.

Write a Scheme function find-common (using at least one abstract list function), which consumes two lists of numbers lst1, and lst2 and produces a list of all elements of lst1 that appear in lst2, with the same order of lst1 . Some examples follow:

(find-common empty empty) => empty

(find-common (list 2 3 56 23 3) (list 3 2 4 56 4 14)) => (list 2 3 56 3)

(find-common (list 56 29) (list 156 329 43)) => empty

You've made like 3 homework threads today.

use foldr to represent recursion. now go away

I don't even know Lisp and I can think of two or three ways of solving this.

^{(elementary problem!)>} ᕦ(ò_óˇ)ᕤ

>>5
if its such an elementary problem, then help me? please...

>>6
No, it's so elementary that you should solve it yourself. You're as dumb as /g/, holy shit.

If you're honestly struggling with this then good luck with any higher-level material.

Asking someone to solve this for you will only ensure your failure later.

I solved it with the use of lambda, but I cannot use lambda yet.

Bump

Is there a way to do this without using lambda?


(define (find-common lst1 lst2)
(filter (lambda (x) (member x lst2)) lst1))

>>11
What do you think?

>>11
Why are you so fucking stupid?

>>13
Why do you think I'm stupid?

>>14
Because you're asking us how can you replace a lambda by something that's not a lambda. I don't understand why you're making such a dumb question, I don't even know why you know what a lambda is.

>>14
You are stupid because you spam /prog/ all day with shit and then ask for help with babby's first exercise.

>>16
Why do you say I spam /prog/ all day with shit and then ask for help with babby's first exercise?

>>15
How?

>>14,17
Hello Eliza.

A lambda is a function without a name, so give it a name and...

>>20
YOU HELPED HIM!