Write a recursive Scheme (Dr Racket) function that takes a list and returns a list in which every member of the input li
Posted: Fri May 20, 2022 12:14 pm
Write a recursive Scheme (Dr Racket) function that takes a list
and returns a list in which every member of the input list is a
list itself. The following examples present the sample uses of the
function. You are not allowed to use the built in "append" or
"set!" functions. You can use the built-in basic functions such as
cons, list, car, cdr, empty?, null? ...
and returns a list in which every member of the input list is a
list itself. The following examples present the sample uses of the
function. You are not allowed to use the built in "append" or
"set!" functions. You can use the built-in basic functions such as
cons, list, car, cdr, empty?, null? ...