Scheme and Lisp Alogrithms are requested for the following specifications:
1. Define purelist? that distinguishes pure lists from others. For example,
(), (a b), ((a b c) ((d)) e) are pure lists and (a . b), (a . (a . b) c),
((a . b) . c) are not pure lists.
2. Define a general map function of the following form:
(map func arg1 arg2 ... argn)
3. A Matrix, shown below on the left, can be represented as a list of lists,
shown on the right.
/ a11 a12 a13 \ ((a11 a12 a13)
| a21 a22 a23 | (a21 a22 a23)
| a31 a32 a33 | (a31 a32 a33)
\ a41 a42 a43 / (a41 a42 a43))
The transpose of a matrix A = ( aij ) is the matrix A = ( aji )
- shown below.
((a11 a21 a31 a41)
(a12 a22 a32 a42)
(a13 a23 a33 a43))
Define a function "transpose" to do this.
In article <··················@csufres.CSUFresno.EDU> ······@csufres.CSUFresno.EDU (Dennis Franklin) writes:
>
>Scheme and Lisp Alogrithms are requested for the following specifications:
>
>1. Define purelist? that distinguishes pure lists from others. For example,
...
>2. Define a general map function of the following form:
...
>3....Define a function "transpose" ...
Looks like somebody's homework to me. I can't see why anyone else
would be interested in #2.
--George
In article <··················@csufres.CSUFresno.EDU> ······@csufres.CSUFresno.EDU (Dennis Franklin) writes:
Scheme and Lisp Alogrithms are requested for the following specifications:
1. Define purelist? that distinguishes pure lists from others. For example,
2. Define a general map function of the following form:
(map func arg1 arg2 ... argn)
3. A Matrix, shown below on the left, can be represented as a list of lists,
shown on the right.
The transpose of a matrix A = ( aij ) is the matrix A = ( aji )
- shown below.
If these are homework or exam questions, then the net should not be used for
this purpose.
Josh